Node Compression Techniques Based on Cache-Sensitive B+-Tree

Cache-conscious indices have been researched for a decade. These index structures can enhance data locality and reduce cache misses. Cache-Sensitive B+-tree (CSB+-tree) is a state-of-the-art, high performance index tree for main-memory database systems. However, in the worst case, the space utilization of CSB+-tree can fall to 25%. The main contribution of this paper is to improve space efficiency of CSB+-tree by using compression mechanisms. We have conducted experimental studies. Results show that the compressed CSB+-trees can yield significant space savings with additional benefits for search and delete operations by utilizing the superiority of modern hardware.

[1]  Kenneth A. Ross,et al.  Efficient Index Compression in DB2 LUW , 2009, Proc. VLDB Endow..

[2]  Gary Valentin,et al.  Fractal prefetching B+-Trees: optimizing both cache and disk performance , 2002, SIGMOD '02.

[3]  Kenneth A. Ross,et al.  Making B+-Trees Cache Conscious in Main Memory , 2000, SIGMOD Conference.

[4]  Todd C. Mowry,et al.  Improving index performance through prefetching , 2001, SIGMOD '01.

[5]  Martin L. Kersten,et al.  Optimizing database architecture for the new bottleneck: memory access , 2000, The VLDB Journal.

[6]  Hector Garcia-Molina,et al.  Main Memory Database Systems: An Overview , 1992, IEEE Trans. Knowl. Data Eng..

[7]  Sang-goo Lee,et al.  CST-Trees: Cache Sensitive T-Trees , 2007, DASFAA.

[8]  Michael J. Carey,et al.  A Study of Index Structures for a Main Memory Database Management System , 1986, HPTS.

[9]  James A. Storer,et al.  Data Compression: Methods and Theory , 1987 .

[10]  James R. Larus,et al.  Cache-conscious structure layout , 1999, PLDI '99.

[11]  Theodore Johnson,et al.  Performance Measurements of Compressed Bitmap Indices , 1999, VLDB.

[12]  Kenneth A. Ross,et al.  Cache Conscious Indexing for Decision-Support in Main Memory , 1999, VLDB.

[13]  Kenneth A. Ross,et al.  Improving Database Performance on Simultaneous Multithreading Processors , 2005, VLDB.

[14]  Daniel S. Hirschberg,et al.  Data compression , 1987, CSUR.

[15]  Balakrishna R. Iyer,et al.  Data Compression Support in Databases , 1994, VLDB.

[16]  Rudolf Bayer,et al.  Prefix B-trees , 1977, TODS.

[17]  Vilho Raatikka,et al.  Cache-Conscious Index Structures for Main-Memory Databases , 2004 .

[18]  Alejandro López-Ortiz,et al.  Fast string sorting using order-preserving compression , 2005, JEAL.

[19]  Martin L. Kersten,et al.  Database Architecture Optimized for the New Bottleneck: Memory Access , 1999, VLDB.

[20]  Gennady Antoshenkov,et al.  Dictionary-based order-preserving string compression , 1997, The VLDB Journal.

[21]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[22]  James R. Larus,et al.  Cache-conscious structure definition , 1999, PLDI '99.

[23]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach (4. ed.) , 2007 .

[24]  David B. Lomet,et al.  Order Preserving Key Compression , 1994 .

[25]  David J. DeWitt,et al.  DBMSs on a Modern Processor: Where Does Time Go? , 1999, VLDB.

[26]  Kenneth A. Ross,et al.  Making B+- trees cache conscious in main memory , 2000, SIGMOD '00.