Compact and succinct data structures for multidimensional orthogonal range searching

DOI10.1016/j.ic.2020.104519zbMath1446.68040OpenAlexW2999656158WikidataQ126342451 ScholiaQ126342451MaRDI QIDQ776842

Kazuki Ishiyama, Kunihiko Sadakane

Publication date: 13 July 2020

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2020.104519

zbMATH Keywords

databasesuccinct data structureorthogonal range searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Entropy-bounded representation of point grids
• Space-efficient data-analysis queries on grids
• New algorithms on wavelet trees and applications to information retrieval
• Decomposable searching problems
• Rank and select revisited and extended
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Optimal Succinctness for Range Minimum Queries
• Multidimensional binary search trees used for associative searching
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
• Practical Entropy-Compressed Rank/Select Dictionary
• An experimental investigation of set intersection algorithms for text searching

This page was built for publication: Compact and succinct data structures for multidimensional orthogonal range searching