Compressing relations and indexes
Authors:
- J. GoldsteinJGJ. Goldstein
- R. RamakrishnanRRR. Ramakrishnan
- U. ShaftUSU. Shaft
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 370-379
Abstract
We propose a new compression algorithm that is tailored to database applications. It can be appliedto a collection of records, and is especially effective for records with many low to medium cardinalityfields. In addition, this new technique supports very fast decompression. (Gzip typically takes 10times the CPU time to decompress relations, while achieving about the same compression ratio.) Our algorithm achieves compression on numeric fields only; while low and medium cardinality fields...Keywords
This publication has 9 references indexed in Scilit:
- Relational database compression using augmented vector quantization2002
- Improved query performance with variant indexes1997
- The TV-tree: An index structure for high-dimensional dataThe VLDB Journal, 1994
- Database compressionACM SIGMOD Record, 1993
- The R*-tree: an efficient and robust access method for points and rectangles1990
- Data Compression in Scientific and Statistical DatabasesIEEE Transactions on Software Engineering, 1985
- R-trees1984
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972