The implementation and performance of compressed databases

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 29, Issue 3, 2000, Pages 55-67

  Westmann, Till ^a   Kossmann, Donald ^b   Helmer, Sven ^a   Moerkotte, Guido ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002567141     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/362084.362137     Document Type: Article

References (31)

1. Software AG. ADABAS im Überblick. Technical Report ADA5000D006IB, Software AG, Munich, Germany, January 1994.
2. G. Antoshenkov, D. Lomet, and J. Murray. Order preserving compression. In Proc. IEEE Conf. on Data Engineering, pages 655-663, New Orleans, LA, USA, 1996.
3. M. Blasgen, R. Casey, and K. Eswaran. An encoding method for multifield sorting and indexing. Technical Report RJ 1753, IBM Research, San Jose, CA, 1976.
4. M. Carey and D. Kossmann. Reducing the braking distance of an SQL query engine. In Proc. of the Conf. on Very Large Data Bases (VLDB), pages 158-169, New York City, NY, USA, August 1998.
5. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
6. G. Cormack. Data compression in a database system. Communications of the ACM, 28(12):1336, December 1985.
7. S. Chaudhuri and K. Shim. Including group-by in query optimization. In VLDB [VLD94], pages 354-366.
8. J.C. Freytag and N. Goodman. On the translation of relational queries into iterative programs. ACM Trans. on Database Systems, 14(1):1, March 1989.
9. G. Graefe and P. O'Neil. Multi-table joins through bitmapped join indices. ACM SIGMOD Record, 24(3):8-11, October 1995.
10. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan-Kaufmann Publishers, San Mateo, CA, USA, 1993.
11. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, June 1993.
12. J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. In Proc. IEEE Conf. on Data Engineering, Orlando, FL, USA, 1998.
13. G. Graefe and L. Shapiro. Data compression and database performance. In Proc. ACM/IEEE-CS Symp. on Applied Computing, Kansas City, MO, April 1991.
14. L. Haas, M. Carey, M. Livny, and A. Skukla. Seeking the truth about ad hoc join costs. The VLDB Journal, 6(3):241-256, July 1997.
15. E. Harris and K. Ramamohanarao. Join algorithm costs revisited. The VLDB Journal, 5(1):64-84, January 1996.
16. D. Huffman. A method for the construction of minimum-redundancy codes. Proc. IRE, 40(9):1098-1101, September 1952.
17. B. Iyer and D. Wilhite. Data compression support in databases. In VLDB [VLD94], pages 695-704.
18. R. Lone and B. Wade. The compilation of a high level data language. Technical Report RJ 2598, IBM Research, San Jose, CA, 1979.
19. A. Moffat and J. Zobel. Parameterised compression for sparse bitmaps. In SIGIR, pages 274-285, 1992.
20. W. Ng and C. Ravishankar. Relational database compression using augmented vector quantization. In Proc. IEEE Conf. on Data Engineering, pages 540-549, Taipeh, Taiwan, 1995.
21. F. Palermo. A database search problem. In Information Systems, pages 67-101. Plenum Publ., New York, NY, 1974.
22. M. Roth and S. Van Horn. Database compression. ACM SIGMOD Record, 22(3):31-39, September 1993.
23. G. Ray, J. Haritsa, and S. Seshadri. Database compression: A performance enhancement tool. In Proc. COMAD, Pune, India, December 1995.
24. D. Severance. A practitioner's guide to data base compression. Information Systems, 8(1):51-62, 1983.
25. L. Shapiro, S. Ni, and G. Graefe. Full-time data compression: An ADT for database performance. Portland State University, OR, USA, 1993.
26. Transaction Processing Performance Council TPC. TPC benchmark D (decision support). Standard Specification 1.0, Transaction Processing Performance Council (TPC), May 1995. http://www.tpc.org/.
27. Proc. of the Conf. on Very Large Data Bases (VLDB), Santiago, Chile, September 1994.
28. R. Wagner. Indexing design considerations. IBM Systems Journal, 12(4):351-367, 1973.
29. T. Welch. A technique for high performance data compression. IEEE Computer, 17(6):8-19, June 1984.
30. I. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, June 1987.
31. W. Yan and P. Larson. Performing group-by before join. In Proc. IEEE Conf. on Data Engineering, pages 89-100, Houston, TX, 1994.