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 language | English |
|---|---|
| Pages | S909-S910 |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 17 Jan 1999 → 19 Jan 1999 |
Conference
| Conference | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 17/01/99 → 19/01/99 |