%0 Journal Article %1 keyhere %A Bandi, Nagender %A Agrawal, Divyakant %A Abbadi, Amr %D 2006 %J Database and Expert Systems Applications %K imported %P 389--398 %T Fast Computation of Database Operations Using Content-Addressable Memories %U http://dx.doi.org/10.1007/11827405_38 %X Research efforts on conventional CPU architectures over the past decade have focused primarily on performance enhancement. In contrast, the NPU (Network Processing Unit) architectures have evolved significantly in terms of functionality. The memoryhierarchy of a typical network router features a Content-Addressable Memory (CAM) which provides very fast constant-time lookupsover large amounts of data and facilitates a wide range of novel high-speed networking solutions such as Packet Classification,Intrusion Detection and Pattern Matching. While these networking applications span an entirely different domain than the databaseapplications, they share a common operation of searching for a particular data entry among huge amounts of data. In this paper,we investigate how CAM-based technology can help in addressing the existing memory hierarchy bottlenecks in database operations.We present several high-speed CAM-based solutions for computationally intensive database operations. In particular, we discussan efficient linear-time complexity CAM-based sorting algorithm and apply it to develop a fast solution for complex join operationswidely used in database applications.

@article{keyhere, abstract = {Research efforts on conventional CPU architectures over the past decade have focused primarily on performance enhancement. In contrast, the NPU (Network Processing Unit) architectures have evolved significantly in terms of functionality. The memoryhierarchy of a typical network router features a Content-Addressable Memory (CAM) which provides very fast constant-time lookupsover large amounts of data and facilitates a wide range of novel high-speed networking solutions such as Packet Classification,Intrusion Detection and Pattern Matching. While these networking applications span an entirely different domain than the databaseapplications, they share a common operation of searching for a particular data entry among huge amounts of data. In this paper,we investigate how CAM-based technology can help in addressing the existing memory hierarchy bottlenecks in database operations.We present several high-speed CAM-based solutions for computationally intensive database operations. In particular, we discussan efficient linear-time complexity CAM-based sorting algorithm and apply it to develop a fast solution for complex join operationswidely used in database applications.}, added-at = {2009-02-03T15:13:43.000+0100}, author = {Bandi, Nagender and Agrawal, Divyakant and Abbadi, Amr}, biburl = {https://www.bibsonomy.org/bibtex/282eef85771d4f00f09e7cc44b921052c/flykeysky}, interhash = {9541e8cae70a7b309fc556ba83cbb8a5}, intrahash = {82eef85771d4f00f09e7cc44b921052c}, journal = {Database and Expert Systems Applications}, keywords = {imported}, pages = {389--398}, timestamp = {2009-02-03T15:13:43.000+0100}, title = {Fast Computation of Database Operations Using Content-Addressable Memories}, url = {http://dx.doi.org/10.1007/11827405_38}, year = 2006 }