Compressing relations and indexes

Authors:
  • JGJ. Goldstein
    J. Goldstein
  • RRR. Ramakrishnan
    R. Ramakrishnan
  • USU. Shaft
    U. Shaft

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...