Compact and succinct data structures for multidimensional orthogonal range searching
From MaRDI portal
Publication:776842
DOI10.1016/J.IC.2020.104519zbMATH Open1446.68040OpenAlexW2999656158WikidataQ126342451 ScholiaQ126342451MaRDI QIDQ776842FDOQ776842
Authors: 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
Recommendations
- On the average performance of orthogonal range search in multidimensional data structures
- scientific article; zbMATH DE number 2086648
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- New Data Structures for Orthogonal Range Queries
- Cache-oblivious data structures for orthogonal range searching
- Orthogonal range searching in linear and almost-linear space
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Space-Time Trade-Offs for Orthogonal Range Queries
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Cites Work
- Optimal succinctness for range minimum queries
- Title not available (Why is that?)
- Practical entropy-compressed rank/select dictionary
- Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
- Decomposable searching problems
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Space-efficient data-analysis queries on grids
- Multidimensional binary search trees used for associative searching
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- An experimental investigation of set intersection algorithms for text searching
- Rank and select revisited and extended
- Entropy-bounded representation of point grids
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
Cited In (18)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
- Multidimensional range selection
- Efficient Data Structures for the Orthogonal Range Successor Problem
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Compressed data structures for range searching
- Orthogonal range searching on the RAM, revisited
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- Title not available (Why is that?)
- Algorithms - ESA 2003
- Some properties of optimal cartesian product files for orthogonal range queries
- Discrete range searching primitive for the GPU and its applications
- Entropy-bounded representation of point grids
- Cache-oblivious data structures for orthogonal range searching
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Entropy-bounded representation of point grids
This page was built for publication: Compact and succinct data structures for multidimensional orthogonal range searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776842)
