Dictionary-based order-preserving string compression for main memory column stores

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 283-295

  Binnig, Carsten ^a   Hildenbrand, Stefan ^a   Färber, Franz ^b  

^a ETH ZURICH   (Switzerland)

^b SAP RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY INTEGER; BUSINESS INTELLIGENCE APPLICATIONS; COLUMN-STORE; COMPRESSION SCHEME; DECISION SUPPORTS; DICTIONARY COMPRESSION; DOMAIN SIZE; INTEGER CODES; LARGE DOMAIN; MAIN MEMORY; QUERY OPERATIONS; STRING COMPRESSION;

DATA COMPRESSION; DATA STRUCTURES; DECISION SUPPORT SYSTEMS;

DATABASE SYSTEMS;

EID: 70849107602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559877     Document Type: Conference Paper

References (24)

1. D. J. Abadi, S. Madden, and M. Ferreira. Integrating Compression and Execution in Column-Oriented Database Systems. In SIGMOD Conference, pages 671-682, 2006.
2. G. Antoshenkov, D. B. Lomet, and J. Murray. Order Preserving String Compression. In ICDE, pages 655-663, 1996.
3. N. Askitis and R. Sinha. HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. In ACSC, pages 97-105, 2007.
4. N. Askitis and J. Zobel. Cache-Conscious Collision Resolution in String Hash Tables. In SPIRE, pages 91-102, 2005.
5. R. Bayer and K. Unterauer. Prefix B-Trees. ACM Trans. Database Syst., 2(1):11-26, 1977.
6. J. L. Bentley and R. Sedgewick. Fast Algorithms for Sorting and Searching Strings. In SODA, pages 360-369, 1997.
7. P. Bohannon, P. McIlroy, and R. Rastogi. Main-Memory Index Structures with Fixed-Size Partial Keys. In SIGMOD Conference, pages 163-174, 2001.
8. Z. Chen, J. Gehrke, and F. Korn. Query Optimization In Compressed Database Systems. In SIGMOD Conference, pages 271-282, 2001.
9. H. Garcia-Molina and K. Salem. Main Memory Database Systems: An Overview. IEEE Trans. Knowl. Data Eng., 4(6):509-516, 1992.
10. J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing Relations and Indexes. In ICDE, pages 370-379, 1998.
11. G. Graefe and P.-Å. Larson. B-Tree Indexes and CPU Caches. In ICDE, pages 349-358, 2001.
12. S. Harizopoulos, V. Liang, and D. J. Abadi. Performance Tradeoffs in Read-Optimized Databases. In VLDB, pages 487-498, 2006.
13. D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
14. D. B. Lomet. The Evolution of Effective B-tree: Page Organization and Techniques. SIGMOD Record, 30(3):64-69, 2001.
15. D. R. Morrison. PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. J. ACM, 15(4):514-534, 1968.
16. J. Rao and K. A. Ross. Cache Conscious Indexing for Decision-Support in Main Memory. In VLDB, pages 78-89, 1999.
17. J. Rao and K. A. Ross. Making B+-Trees Cache Conscious in Main Memory. In SIGMOD Conference, pages 475-486, 2000.
18. R. Sinha, J. Zobel, and D. Ring. Cache-Efficient String Sorting Using Copying. ACM Journal of Experimental Algorithms, 11, 2006.
19. M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran, and S. B. Zdonik. C-Store: A Column-oriented DBMS. In VLDB, pages 553-564, 2005.
20. S. P. Vanderwiel and D. J. Lilja. Data Prefetch Mechanisms. ACM Comput. Surv., 32(2):174-199, 2000.
21. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes (2nd ed.): Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1999.
22. J. Zhou and K. A. Ross. Buffering Accesses to Memory-Resident Index Structures. In VLDB, pages 405-416, 2003.
23. M. Zukowski, P. A. Boncz, N. Nes, and S. Héman. MonetDB/X100 - A DBMS In The CPU Cache. IEEE Data Eng. Bull., 28(2):17-22, 2005.
24. M. Zukowski, S. Héman, N. Nes, and P. A. Boncz. Super-Scalar RAM-CPU Cache Compression. In ICDE, page 59, 2006.