Nothing Special   »   [go: up one dir, main page]

Skip to main content

Fast Computation of Database Operations Using Content-Addressable Memories

  • Conference paper
Database and Expert Systems Applications (DEXA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4080))

Included in the following conference series:

  • 1445 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. Shatdal, A., Kant, C., Naughton, J.: Cache Conscious Algorithms for Relational Query Processing. In: VLDB, pp. 510–512 (1994)

    Google Scholar 

  4. Chen, S., Ailamaki, A., Gibbons, P.B., Mowry, T.C.: Improving Hash Join Performance through Prefetching. In: ICDE (2004)

    Google Scholar 

  5. Narlikar, G.J., Basu, A., Zane, F.: Coolcams: Power-efficient tcams for forwarding engines. In: INFOCOM (2003)

    Google Scholar 

  6. Yu, F., Katz, R.H.: Efficient Multi-Match Packet Classification with TCAM. In: IEEE Hot Interconnects 2004 (2004)

    Google Scholar 

  7. DeFiore, C.F., Berra, P.B.: A Data Management System Utilizing an Associative Memory. In: AFIPS NCC, vol. 42 (1973)

    Google Scholar 

  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. Panigrahy, R., Sharma, S.: Sorting and Searching using Ternary CAMs. IEEE Micro (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bandi, N., Agrawal, D., El Abbadi, A. (2006). Fast Computation of Database Operations Using Content-Addressable Memories. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_38

Download citation

  • DOI: https://doi.org/10.1007/11827405_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37871-6

  • Online ISBN: 978-3-540-37872-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics