Cache-oblivious data structures for orthogonal range searching

DOI10.1145/777792.777828MaRDI QIDQ5361629zbMATH OpenOpenAlexFDO

Authors Lars Arge, Andrew Danner, Bryan Holland-Minkley, Pankaj K. Agarwal

Publication date 29 September 2017

Published in Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/777792.777828

zbMATH Keywords

cache-obliviousorthogonal range searching

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Cache-oblivious planar orthogonal range searching and counting
• Compact and succinct data structures for multidimensional orthogonal range searching
• New Data Structures for Orthogonal Range Queries
• Orthogonal range searching on the RAM, revisited
• Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
• scientific article; zbMATH DE number 2086648
• On the average performance of orthogonal range search in multidimensional data structures
• Efficient Data Structures for the Orthogonal Range Successor Problem
• Space-Time Trade-Offs for Orthogonal Range Queries
• Space efficient data structures for dynamic orthogonal range counting

Cited in

(25)

• Cache-oblivious R-trees
• Space efficient dynamic orthogonal range reporting
• Opportunistic data structures for range queries
• Search-Order Independent State Caching
• A locality-preserving cache-oblivious dynamic dictionary
• Cache-oblivious iterated predecessor queries via range coalescing
• scientific article; zbMATH DE number 2086622 (Why is no real title available?)
• scientific article; zbMATH DE number 2086641 (Why is no real title available?)
• scientific article; zbMATH DE number 2119641 (Why is no real title available?)
• scientific article; zbMATH DE number 2119642 (Why is no real title available?)
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting
• Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
• On Cartesian trees and range minimum queries
• Cache-oblivious planar orthogonal range searching and counting
• Cache-oblivious R-trees
• A general approach for cache-oblivious range reporting and approximate range counting
• Orthogonal range searching on the RAM, revisited
• Cache-oblivious range reporting with optimal queries requires superlinear space
• Cache-Oblivious B-Trees
• I/O-efficient data structures for colored range and prefix reporting
• Algorithms - ESA 2003
• The cost of cache-oblivious searching
• Pargeo: a library for parallel computational geometry
• Compact and succinct data structures for multidimensional orthogonal range searching
• A general approach for cache-oblivious range reporting and approximate range counting

This page was built for publication: Cache-oblivious data structures for orthogonal range searching

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