New Data Structures for Orthogonal Range Queries
From MaRDI portal
Publication:3678701
DOI10.1137/0214019zbMATH Open0564.68071OpenAlexW1987225278MaRDI QIDQ3678701FDOQ3678701
Authors: Dan E. Willard 
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
Recommendations
Cited In (58)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- On-line updating of solutions to a class of matroid intersection problems
- Optimal MMI file systems for orthogonal range retrieval
- Multivariate analysis of orthogonal range searching and graph distances
- An algorithm for handling many relational calculus queries efficiently.
- An application of $m$-ary trees to the design of data structures for geometric searching problems
- Multidimensional segment trees can do range updates in poly-logarithmic time
- Space efficient dynamic orthogonal range reporting
- Polygonal intersection searching
- Computing Shapley values in the plane
- Monge properties of sequence alignment
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Computing on a free tree via complexity-preserving mappings
- Light orthogonal networks with constant geometric dilation
- The \(k\)-means range algorithm for personalized data clustering in e-commerce
- Computing rectangle enclosures
- Dynamic orthogonal range queries in OLAP.
- Space-efficient data-analysis queries on grids
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- New trie data structures which support very fast search operations
- A data structure for dynamic range queries
- Optimal solutions for a class of point retrieval problems
- Maintaining range trees in secondary memory. Part I: Partitions
- A deterministic skip list for \(k\)-dimensional range search
- Dynamic fractional cascading
- L-infinity interdistance selection by parametric search
- Range searching in multidimensional databases using navigation metadata
- Approximate colored range and point enclosure queries
- Chaining algorithms for multiple genome comparison
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- Compact and succinct data structures for multidimensional orthogonal range searching
- Non-orthogonal homothetic range partial-sum query on integer grids (extended abstract)
- Title not available (Why is that?)
- Algorithms - ESA 2003
- Parallel general prefix computations with geometric, algebraic, and other applications
- Multivariate analysis of orthogonal range searching and graph distances
- (Approximate) uncertain skylines
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Orthogonal queries in segments
- Of concurrent data structures and iterations
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Fractional cascading. II: Applications
- Opportunistic data structures for range queries
- Some properties of optimal cartesian product files for orthogonal range queries
- Minimal output unstable configurations in chemical reaction networks and deciders
- Extending range queries and nearest neighbors
- Cache-oblivious data structures for orthogonal range searching
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Priority Search Trees
- Space efficient data structures for dynamic orthogonal range counting
- Fringed-quadtrees: a new kind of data structure
- Title not available (Why is that?)
- A unified approach to geometric problems using dual cone transformation:
- External memory fully persistent search trees
This page was built for publication: New Data Structures for Orthogonal Range Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678701)
