Abstract
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Hershberger, J., Shrivastava, N., Suri, S. et al. Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46, 97–117 (2006). https://doi.org/10.1007/s00453-006-0070-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0070-3