Compressed Data Structures for Range Searching

Conference paper

DOI: 10.1007/978-3-319-15579-1_45

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8977)
Cite this paper as:
Bille P., Gørtz I.L., Vind S. (2015) Compressed Data Structures for Range Searching. In: Dediu AH., Formenti E., Martín-Vide C., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science, vol 8977. Springer, Cham


We study the orthogonal range searching problem on points that have a significant number of geometric repetitions, that is, subsets of points that are identical under translation. Such repetitions occur in scenarios such as image compression, GIS applications and in compactly representing sparse matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repetitions that may appear in standard range searching data structures (such as K-D trees, Quad trees, Range trees, R-trees, Priority R-trees, and K-D-B trees), and how to implement subsequent range queries on the compressed representation with only a constant factor overhead. Secondly, we present a compression scheme that efficiently identifies geometric repetitions in point sets, and produces a hierarchical clustering of the point sets, which combined with the first result leads to a compressed representation that supports range searching.


Data and image compression Range searching Relative tree DAG compression Hierarchical clustering 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.DTU ComputeTechnical University of DenmarkKongens LyngbyDenmark

Personalised recommendations