Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions

DOI10.1137/1.9781611973754.8MaRDI QIDQ5232525zbMATH OpenOpenAlexFDO

Authors Yuzuru Okajima, Kouichi Maruyama

Publication date 12 September 2019

Published in 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973754.8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Orthogonal range searching in linear and almost-linear space
• Orthogonal Range Searching in Linear and Almost-Linear Space
• Compact and succinct data structures for multidimensional orthogonal range searching
• scientific article; zbMATH DE number 2086648
• On the average performance of orthogonal range search in multidimensional data structures
• Space-Time Trade-Offs for Orthogonal Range Queries
• Cache-oblivious data structures for orthogonal range searching
• The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
• Orthogonal range searching on the RAM, revisited
• New Data Structures for Orthogonal Range Queries

Cited in

(8)

• 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
• Rank selection in multidimensional data
• Orthogonal range searching on the RAM, revisited
• Ranked document selection
• Compact and succinct data structures for multidimensional orthogonal range searching
• Cache-oblivious data structures for orthogonal range searching

This page was built for publication: Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions

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