New Data Structures for Orthogonal Range Queries
From MaRDI portal
Publication:3678701
DOI10.1137/0214019zbMath0564.68071OpenAlexW1987225278MaRDI QIDQ3678701
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214019
Related Items
An algorithm for handling many relational calculus queries efficiently. ⋮ Computing rectangle enclosures ⋮ Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ On-line updating of solutions to a class of matroid intersection problems ⋮ Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ Computing on a free tree via complexity-preserving mappings ⋮ Fractional cascading. II: Applications ⋮ Orthogonal queries in segments ⋮ Of Concurrent Data Structures and Iterations ⋮ The \(k\)-means range algorithm for personalized data clustering in e-commerce ⋮ L-infinity interdistance selection by parametric search ⋮ Range searching in multidimensional databases using navigation metadata ⋮ (Approximate) uncertain skylines ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Space-efficient data-analysis queries on grids ⋮ A unified approach to geometric problems using dual cone transformation: ⋮ Dynamic orthogonal range queries in OLAP. ⋮ Monge properties of sequence alignment ⋮ Unnamed Item ⋮ Dynamic fractional cascading ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Polygonal intersection searching ⋮ Multidimensional segment trees can do range updates in poly-logarithmic time ⋮ Space efficient dynamic orthogonal range reporting ⋮ A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time ⋮ A deterministic skip list for \(k\)-dimensional range search ⋮ Unnamed Item ⋮ The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching ⋮ Light orthogonal networks with constant geometric dilation ⋮ Approximate colored range and point enclosure queries ⋮ Minimal output unstable configurations in chemical reaction networks and deciders ⋮ Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ A data structure for dynamic range queries ⋮ Extending range queries and nearest neighbors ⋮ Multivariate analysis of orthogonal range searching and graph distances ⋮ Chaining algorithms for multiple genome comparison ⋮ New trie data structures which support very fast search operations ⋮ Optimal solutions for a class of point retrieval problems ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects ⋮ Computing Shapley values in the plane
