Advertisement

Fast Computation of Database Operations Using Content-Addressable Memories

  • Nagender Bandi
  • Divyakant Agrawal
  • Amr El Abbadi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4080)

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 memory hierarchy of a typical network router features a Content-Addressable Memory (CAM) which provides very fast constant-time lookups over 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 database applications, 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 discuss an efficient linear-time complexity CAM-based sorting algorithm and apply it to develop a fast solution for complex join operations widely used in database applications.

Keywords

Binary Search Nest Loop Sorting Algorithm Memory Hierarchy Database Application 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ailamaki, A.G., DeWitt, D.J., Hill, M.D., Wood, D.A.: DBMSs On a Modern Processor: Where Does Time Go? In: VLDB, pp. 266–277 (1999)Google Scholar
  2. 2.
    Boncz, P., Manegold, S., Kersten, M.L.: Database Architecture Optimized for the New Bottleneck: Memory Access. In: VLDB, pp. 266–277 (1999)Google Scholar
  3. 3.
    Shatdal, A., Kant, C., Naughton, J.: Cache Conscious Algorithms for Relational Query Processing. In: VLDB, pp. 510–512 (1994)Google Scholar
  4. 4.
    Chen, S., Ailamaki, A., Gibbons, P.B., Mowry, T.C.: Improving Hash Join Performance through Prefetching. In: ICDE (2004)Google Scholar
  5. 5.
    Narlikar, G.J., Basu, A., Zane, F.: Coolcams: Power-efficient tcams for forwarding engines. In: INFOCOM (2003)Google Scholar
  6. 6.
    Yu, F., Katz, R.H.: Efficient Multi-Match Packet Classification with TCAM. In: IEEE Hot Interconnects 2004 (2004)Google Scholar
  7. 7.
    DeFiore, C.F., Berra, P.B.: A Data Management System Utilizing an Associative Memory. In: AFIPS NCC, vol. 42 (1973)Google Scholar
  8. 8.
    Bandi, N., Schneider, S., Agrawal, D., Abbadi, A.E.: Hardware Acceleration of Database Operations using Content Addressable Memories. In: ACM, Data Management on New Hardware (DaMoN) (2005)Google Scholar
  9. 9.
    Panigrahy, R., Sharma, S.: Sorting and Searching using Ternary CAMs. IEEE Micro (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nagender Bandi
    • 1
  • Divyakant Agrawal
    • 1
  • Amr El Abbadi
    • 1
  1. 1.Computer ScienceUniversity of California at Santa Barbara 

Personalised recommendations