Data compression and database performance

Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991

Volumn , Issue , 1991, Pages 22-27

  Graefe, Goetz ^a   Shapiro, Leonard D ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH COMPRESSION; DATA HANDLING; DIGITAL STORAGE; INFORMATION MANAGEMENT; QUERY PROCESSING;

COMPRESSED DATUM; COMPRESSED STATE; COMPRESSION FACTOR; DATABASE PERFORMANCE; NETWORK BANDWIDTH; QUERY PROCESSING ALGORITHMS; STORAGE SPACES;

DATA COMPRESSION;

EID: 85050540671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SOAC.1991.143840     Document Type: Conference Paper

References (33)

1. P. A. Alsberg, "Space and Time Savings Through Large Data Base Compression and Dynamic Restructuring", Proc. of the IEEE 63, 8 (August 1975), 1114-1122.
2. T. Bell I. H. Witten and J. G. Cleary, "Modelling for Text Compression", ACM Computing Surveys 21, 4 (December 1989), 557.
3. D. Bitton and J. Gray, "Disk Shadowing", Proceedings, of the Conference on Very Large Databases, Long Beach, CA., August 1988, 331-338.
4. H. Boral and D. J. DeWitt, "Database Machines: An Idea Whose Time Has Passed? A Critique of the Future of Database Machines", Proceeding of the International Workshop on Database Machines, Munich, 1983.
5. K. Bratbergsengen, "Hashing Methods and Relational Algebra Operations", Proceedings of the Conference on Very Large Data Bases, Singapore, August 1984, 323-333.
6. G. V. Cormack, "Data Compression In a Database System", Communications of the ACM 28, 12 (December 1985), 1336-1342.
7. D. J. DeWitt R. Katz F. Olken L. Shapiro M. Stonebraker and D. Wood, "Implementation Techniques for Main Memory Database Systems", Proceedings of the ACM SIGMOD Conference, Boston, MA., June 1984, 1-8.
8. S. J. Eggers and A. Shoshani, "Efficient Access of Compressed Data", Proceedings of the Conference on Very Large Data Bases, Montreal, Canada, October 1980, 205-211.
9. S. J. Eggers F. Olken and A. Shoshani, "A Compression Technique for Large Statistical Data Bases", Proceeding of the Conference on Very Large Data Bases, Cannes, France, September 1981, 424-434.
10. L. Felician and A. Gentili, "A nearly optimal Huffman technique in the microcomputer environment", Information Systems 12, 4(1987), 371.
11. R. G. Gallager, "Variations on a Theme by Huffman", IEEE Transactions on Information Theory IT-24, 6(1978), 668-674.
12. M. E. Gonzalez-Smith and J. A. Storer, "Parallel Algorithms for Data Compression", Journal of the ACM 32, 2 (April 1985), 344.
13. P. Goyal, "Coding methods for text string search on compressed databases", Information Systems 8, 3(1983), 231.
14. G. Graefe and S. S. Thakkar, "Tuning a Parallel Database Algorithm on a Shared-Memory Multiprocessor", CU Boulder Comp. Sci. Tech. Rep. 470, April 1990.
15. L. Haas W. Chan G. Lohman J. McPherson P. F. Wilms G. Lapis B. Lindsay H. Pirahesh, M. J. Carey and E. Shekita, "Starburst Mid-Flight: As the Dust Clears", IEEE Transactions on Knowledge and Data Engineering 2, 1 (March 1990), 143-160.
16. D. A. Huffman, "A method for the construction of minimum redundancy codes", Proc. IRE 40(1952), 1098-1101.
17. D. E. Knuth, "Dynamic Huffman coding", Journal of Algorithms 6(1985), 163-180.
18. D. A. Lelewer D. S. Hirschberg, "Data Compression", ACM Computing Surveys 19, 3 (September 1987), 261-296.
19. J. Li, D. Rotem and H. Wong, "A New Compression Method with Fast Searching on Large Data Bases", Proceeding of the Conference on Very Large Data Bases, Brighton, England, August 1987, 311-318.
20. C. A. Lynch and E. B. Brownrigg, "Application of Data Compression to a Large Bibliographic Data Base", Proceeding of the Conference on Very Large Data Bases, Cannes, France, September 1981, 435-447.
21. F. Olken and D. Rotem, "Rearranging Data to Maximize the Efficiency of Compression", Journal of Computer and System Sciences 38, 2(1989), 405.
22. M. Rodeh V. R. Pratt and S. Even, "Linear Algorithm for Data Compression via String Matching", Journal of the ACM 28, 1 (January 1981), 16.
23. S. S. Ruth and P. J. Keutzer, "Data compression for business files", Datamation 18 (September 1972), 62-66.
24. D. Schneider and D. DeWitt, "A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment", Proceedings of the ACM SIGMOD Conference, Portland, OR, May-June 1989, 110.
25. D. G. Severance, "A practitioner's guide to data base compression", Information Systems 8, 1(1983), 51.
26. L. D. Shapiro, "Join Processing in Database Systems with Large Main Memories", ACM Transactions on Database Systems 11, 3 (September 1986), 239-264.
27. J. A. Storer, Data Compression: Methods and Theory, Computer Science Press, New York, NY, 1988.
28. M. Toyama and S. Ura, "Fixed Length Semiorder Preserving Code for Field Level Data File Compression", Proceedings of the IEEE Conference on Data Engineering, Los Angeles, CA., April 1984, 244.
29. T. A. Welch, "A Technique for High Performance Data Compression", IEEE Computer 17 (June 1984), 8-19.
30. R. N. Williams, "Dynamic-historic predictive compression", Information Systems 13, 1(1988), 141.
31. H. K. T. Wong and J. C. Li, "Transposition Algorithms on Very Large Compressed Data", Proceeding of the Conference on Very Large Data Bases, Kyoto, Japan, August 1986, 304-311.
32. J. Ziv and A. Lempel, "A Universal algorithm for sequential data compression", IEEE Transactions on Information Theory IT-23, 3 (May 1977), 337-343.
33. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding", IEEE Transactions on Information Theory IT-24, 5 (September 1978), 530-536.