Date of Original Version
© ACM, 1997. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
Abstract or Description
Ad hoc querying is difficult on very large datasets, since it is usually not possible to have the entire dataset on disk. While compression can be used to decrease the size of the dataset, compressed data is notoriously difficult to index or access. In this paper we consider a very large dataset comprising multiple distinct time sequences. Each point in the sequence is a numerical value. We show how to compress such a dataset into a format that supports ad hoc querying, provided that a small error can be tolerated when the data is uncompressed. Experiments on large, real world datasets (AT&T customer calling patterns) show that the proposed method achieves an average of less than 5% error in any data value after compressing to a mere 2.5% of the original space (i.e., a 40:1 compression ratio), with these numbers not very sensitive to dataset size. Experiments on aggregate queries achieved a 0.5% reconstruction error with a space requirement under 2%.
Proceedings of the 1997 ACM SIGMOD international Conference on Management of Data , J. M. Peckman, S. Ram, and M. Franklin, Eds. SIGMOD '97, 289-300.