Compressed data structures for range searching

DOI10.1007/978-3-319-15579-1_45zbMATH Open1451.68101OpenAlexW593266450WikidataQ60554365 ScholiaQ60554365MaRDI QIDQ2799208FDOQ2799208

Authors: Philip Bille, Inge Li Gørtz, Søren Vind 

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/d950e31a-5ec6-4691-b44b-83b8de85bda1

Recommendations

• Compact and succinct data structures for multidimensional orthogonal range searching
• Faster compressed quadtrees
• Approximate range searching
• Opportunistic data structures for range queries
• Computing and Combinatorics

zbMATH Keywords

hierarchical clusteringrange searchingdata and image compressionDAG compressionrelative tree

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (4)

• Compressed Data Structures for Dynamic Sequences
• Spatio-temporal range searching over compressed kinetic sensor data
• Entropy-bounded representation of point grids
• Entropy-bounded representation of point grids

This page was built for publication: Compressed data structures for range searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799208)