Query optimization in compressed database systems

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

Volumn 30, Issue 2, 2001, Pages 271-282

  Chen, Zhiyuan ^a   Gehrke, Johannes ^a   Korn, Flip ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040746930     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375692     Document Type: Article

References (33)

1. Transaction processing performance council. TPC-H benchmark, http://www.tpc.org, 1999.
2. Predator DMBS. http://www.cs.cornell.edu/database/predator, Cornell Univ., Computer Science Dept., 2000.
3. S. Amer-Yahia and T. Johnson. Optimizing queries on compressed bitmaps. In Proc. of VLDB, pages 329-338, 2000.
4. G. Antoshenkov, D. B. Lomet, and J. Murray. Order preserving compression. In Proc. of ICDE, pages 655-663, 1996.
5. C. Blake and C. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/∼mlearn/MLRepository.html, 1998.
6. P. A. Boncz, S. Manegold, and M. L. Kersten. Database architecture optimized for the new bottleneck: Memory access. In Proc. of VLDB, pages 54-65, 1999.
7. S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. TODS, 24(2):177-228, 1999.
8. Z. Chen and P. Seshadri. An algebraic compression framework for query results. In Proc. of ICDE, pages 177-188, 2000.
9. J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Trans. on Communications COM-32(4), pages 396-402, April 1984.
10. G. Cormack. Data compression in a database system. Commnications of the ACM, pages 1336-1342, Dec. 1985.
11. S. J. Eggers, F. Olken, and A. Shoshani. A compression technique for large statistical data-bases. In Proc. of VLDB, pages 424-434, 1981.
12. J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. In Proc. of ICDE, pages 370-379, 1998.
13. J. Goldstein, R. Ramakrishnan, and U. Shaft. Squeezing the most out of relational database systems. In Proc. of ICDE, page 81, 2000.
14. G. Graefe. Options in physical databases. SIGMOD Record 22(3), pages 76-83, Sept. 1993.
15. G. Graefe and L. Shapiro. Data compression and database performance. In ACM/IEEE-CS Symp. On Applied Computing, pages 22-27, April 1991.
16. R. Greer. Daytona and the fourth-generation language cymbal. In Proc. of SIGMOD, pages 525-526, 1999.
17. J. M. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proc. of SIGMOD, pages 267-276, 1993.
18. D. Huffman. A method for the construction of minimum-redundanc codes. In Proc. IRE, 40(9), pages 1098-1101, Sept. 1952.
19. B. R. Iyer and D. Wilhite. Data compression support in databases. In Proc. of VLDB, pages 695-704, 1994.
20. T. J. Lehman and M. J. Carey. Query processing in main memory database management systems. In Proc. of SIGMOD, pages 239-250, 1986.
21. J. Li, D. Rotem, and J. Srivastava. Aggregation algorithms for very large compressed data warehouses. In Proc. of VLDB, pages 651-662, 1999.
22. H. Liefke and D. Suciu. Xmill: An efficient compressor for XML data. In Proc. of SIGMOD, pages 153-164, 2000.
23. W. K. Ng and C.V. Ravishankar. Relational database compression using augmented vector quantization. In Proc. of ICDE, pages 540-549, 1995.
24. G. Ray, J. R. Harista, and S. Seshadri. Database compression: A performance enhancement tool. In the 7th Int'l Conf. on Management of Data (COMAD), Pune, India, 1995.
25. M. A. Roth and S. J. V. Horn. Database compression. SIGMOD Record, 22(3):31-39, 1993.
26. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proc. of SIGMOD, pages 23-34, 1979.
27. D. Severance. A practitioner's guide to database compression. Information Systems 8(1), pages 51-62, 1983.
28. T. Welch. A technique for high-performance data compression. IEEE Computer 17(6), pages 8-19, June 1984.
29. T. Westmann, D. Kossmann, S. Helmer, and G. Moerkotte. The implementation and performance of compressed databases. SIGMOD Record 29(3), Sept. 2000.
30. I. H. Witten, A. Moffat, and T. C. Bell. Managing Giga Bytes - Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Inc, 1999.
31. I. H. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6), pages 520-540, June 1987.
32. J. Ziv and A. Lempel. On the complexity of finite sequences. IEEE Trans. on Information Theory, 22(1), pages 75-81, 1976.
33. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans.on Information Theory, 22(1), pages 337-343, 1977.