## Synopsis Data Structures for Massive Data Sets

Citations: | 109 - 13 self |

### BibTeX

@MISC{Gibbons_synopsisdata,

author = {Phillip B. Gibbons and Yossi Matias},

title = { Synopsis Data Structures for Massive Data Sets},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Massive data sets with terabytes of data are becoming commonplace. There is an increasing demand for algorithms and data structures that provide fast response times to queries on such data sets. In this paper, we describe a context for algorithmic work relevant to massive data sets and a framework for evaluating such work. We consider the use of "synopsis" data structures, which use very little space and provide fast (typically approximated) answers to queries. The design and analysis of effective synopsis data structures o er many algorithmic challenges. We discuss a number of concrete examples of synopsis data structures, and describe fast algorithms for keeping them up-to-date in the presence of online updates to the data sets.