ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Efficient Access of Compressed Data.

Susan J. Eggers, Arie Shoshani: Efficient Access of Compressed Data. VLDB 1980: 205-211
@inproceedings{DBLP:conf/vldb/EggersS80,
  author    = {Susan J. Eggers and
               Arie Shoshani},
  title     = {Efficient Access of Compressed Data},
  booktitle = {Sixth International Conference on Very Large Data Bases, October
               1-3, 1980, Montreal, Quebec, Canada, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1980},
  pages     = {205-211},
  ee        = {db/conf/vldb/EggersS80.html},
  crossref  = {DBLP:conf/vldb/80},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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.

Copyright © 1980 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Sixth International Conference on Very Large Data Bases, October 1-3, 1980, Montreal, Quebec, Canada, Proceedings. IEEE Computer Society 1980
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
...
[2]
...
[3]
Don S. Batory: On Searching Transposed Files. ACM Trans. Database Syst. 4(4): 531-544(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
...
[5]
Bruce Hahn: A New Technique for Compression and Storage of Data. Commun. ACM 17(8): 434-436(1974) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
Michael Hammer, Bahram Niamir: A Heuristic Approach to Attribute Partitioning. SIGMOD Conference 1979: 93-101 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
Ellis Horowitz, Sartaj Sahni: Fundamentals of Computer Algorithms. Computer Science Press 1978
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
Per Svensson: On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files. VLDB 1979: 155-163 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Robert Endre Tarjan, Andrew Chi-Chih Yao: Storing a Sparse Table. Commun. ACM 22(11): 606-611(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
M. J. Turner, R. Hammond, P. Cotton: A DBMS for Large Statistical Databases. VLDB 1979: 319-327 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Tue Mar 16 02:21:56 2010 by Michael Ley (ley@uni-trier.de)