, Volume 46, Issue 1, pp 97–117 | Cite as

Adaptive Spatial Partitioning for Multidimensional Data Streams

  • John Hershberger
  • Nisheeth Shrivastava
  • Subhash Suri
  • Csaba D. Toth


We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries efficiently. For instance, we can track ε-hot spots, which are congruent boxes containing at least an ε fraction of the stream, and maintain hierarchical heavy hitters in d dimensions. Our sketch can also be viewed as a multidimensional generalization of the ε-approximate quantile summary. The space complexity of our scheme is O((1/ε) log R) if the points lie in the domain [0, R]d, where d is assumed to be a constant. The scheme extends to the sliding window model with a log (ε n) factor increase in space, where n is the size of the sliding window. Our sketch can also be used to answer ε-approximate rectangular range queries over a stream of d-dimensional points.


Data Stream Range Query Cold Spot Expiration Time Range Counting 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Mentor Graphics Corp., 8005 SW Boeckman RoadWilsonville, OR 97070USA
  2. 2.Department of Computer Science, University of California at Santa BarbaraSanta Barbara, CA 93106USA
  3. 3.Department of Mathematics, Room 2-336, MITCambridge, MA 02139USA

Personalised recommendations