Efficient access of compressed data

Authors:
Susan J. Eggers;Arie Shoshani
Affiliations:
-;-
Venue:
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Year:
1980

Citing 4
Cited 0

On searching transposed files

ACM Transactions on Database Systems (TODS)
Storing a sparse table

Communications of the ACM
A new technique for compression and storage of data

Communications of the ACM
A heuristic approach to attribute partitioning

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a compression technique is presented which allows a high degree of compression but requires only logarithmic access time. The technique is a constant suppression scheme, and is most applicable to stable databases whose distribution of constants is fairly clustered. Furthermore, the repeated use of the technique permits the supression of a multiple number of different constants. Of particular interest is the applicaticn of the constant suppression technique to databases whose composite key is made up of an incomplete cross product of several attribute domains. The scheme for compressing the full cross product composite key is well known. In this paper, harever, the general, incomplete case is also handled by applying the constant suppression technique in conjunction with a composite key suppression scheme.