# Encyclopedia of Database Systems

Living Edition
| Editors: Ling Liu, M. Tamer Özsu

# Geometric Stream Mining

• Cecilia M. Procopiuc
Living reference work entry
DOI: https://doi.org/10.1007/978-1-4899-7993-3_180-2

## Definition

Let P = {p1, p2, …}be a stream of points in the metric space (X, Lq). Usually, X = d or X = {1,  … , U}d (discrete case), and Lq = L2 is the Euclidean distance. The set P is called a spatial data stream. Geometric stream mining algorithms compute the (approximate) answer to a geometric question over the subset of P seen so far. For example, the diameter problem asks to maintain the pair of points that are farthest away in the current stream. A more comprehensive list of problems is presented later.

## Historical Background

Geometric algorithms in the offline setting have been extensively studied over the past decades. Their applications encompass many fields, such as image processing, robotics, data mining, or VLSI design. For an introduction to computational geometry, refer to the book [8]. On the other hand, research on spatial data streams is a recent development. Shortly after the first results on numeric data streams appeared, a slew of papers argued that in many...

## Keywords

Query Point Minimum Span Tree Problem Range Counting Offline Algorithm Spatial Stream
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

1. 1.
Agarwal PK, Har-Peled S, Varadarajan KR. Approximating extent measures of points. J ACM. 2004;51(4):606–33.
2. 2.
Bagchi A, Chaudhary A, Eppstein D, Goodrich MT. Deterministic sampling and range counting in geometric data streams. In: Proceedings of the 20th annual symposium on computational geometry. 2004.p. 144–51.Google Scholar
3. 3.
Chan TM. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput Geom. 2006;35(1–2):20–35.
4. 4.
Cormode G, Muthukrishnan S, Rozenbaum I Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: Proceedings of the 31st international conference on very large data bases. 2005. p. 25–36.Google Scholar
5. 5.
Frahling G, Indyk P, Sohler C Sampling in dynamic data streams and applications. In: Proceedings of the 21st annual symposium on computational geometry. 2005. 142–9.Google Scholar
6. 6.
Indyk P. Algorithms for dynamic geometric problems over data streams. In: Proceedings of the 41st annual ACM symposium on theory of computing. 2004. p. 373–80.Google Scholar
7. 7.
Korn F, Muthukrishnan S, Srivastava D. Reverse nearest neighbor aggregates over data streams. In: Proceedings 28th international conference on very large data bases. 2002. p. 814–25.Google Scholar
8. 8.
Preparata FP, Shamos MI. Computational geometry: an introduction. 3rd ed. Berlin Hiedelberg New York: Springer; 1990.
9. 9.
Vitter JS. Random sampling with a reservoir. ACM Trans Math Software. 1985;11(1):37–57.