Synopsis data structures for massive data sets

Phillip B. Gibbons, Yossi Matias

Research output: Contribution to conferencePaperpeer-review

Abstract

A growing number of applications demand algorithms and data structures that enable the efficient processing of data sets with gigabytes to terabytes to petabytes of data. Such massive data sets necessarily reside on disks or tapes, making even a few accesses of the base data set comparably slow. A study was conducted which considers synopsis data structures for supporting queries to massive data sets, while minimizing or avoiding disk accesses. In particular, the use of small space data structures was advocated.

Original languageEnglish
PagesS909-S910
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: 17 Jan 199919 Jan 1999

Conference

ConferenceProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period17/01/9919/01/99

Fingerprint

Dive into the research topics of 'Synopsis data structures for massive data sets'. Together they form a unique fingerprint.

Cite this