New Data Structures for Orthogonal Range Queries
From MaRDI portal
Recommendations
Cited in
(67)- Light orthogonal networks with constant geometric dilation
- Approximate colored range and point enclosure queries
- Optimal solutions for a class of point retrieval problems
- On-line updating of solutions to a class of matroid intersection problems
- 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
- L-infinity interdistance selection by parametric search
- Maintaining range trees in secondary memory. Part I: Partitions
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Polygonal intersection searching
- Divided \(k-d\) trees
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Orthogonal queries in segments
- Some properties of optimal cartesian product files for orthogonal range queries
- Dynamic orthogonal range queries in OLAP.
- A deterministic skip list for \(k\)-dimensional range search
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- A data structure for dynamic range queries
- Extending range queries and nearest neighbors
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
- An algorithm for handling many relational calculus queries efficiently.
- Computing Shapley values in the plane
- Multidimensional segment trees can do range updates in poly-logarithmic time
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- Minimal output unstable configurations in chemical reaction networks and deciders
- Computing rectangle enclosures
- Space efficient dynamic orthogonal range reporting
- Opportunistic data structures for range queries
- Chaining algorithms for multiple genome comparison
- Range searching in multidimensional databases using navigation metadata
- Of concurrent data structures and iterations
- (Approximate) uncertain skylines
- Priority Search Trees
- Space efficient data structures for dynamic orthogonal range counting
- Space-efficient data-analysis queries on grids
- scientific article; zbMATH DE number 140471 (Why is no real title available?)
- Monge properties of sequence alignment
- A unified approach to geometric problems using dual cone transformation:
- An application of m-ary trees to the design of data structures for geometric searching problems
- Multivariate analysis of orthogonal range searching and graph distances
- scientific article; zbMATH DE number 7559220 (Why is no real title available?)
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- Fringed-quadtrees: a new kind of data structure
- Cache-oblivious data structures for orthogonal range searching
- Algorithms - ESA 2003
- External memory fully persistent search trees
- Quantum data structure for range minimum query
- Optimal MMI file systems for orthogonal range retrieval
- Set cover, hitting set, and independent set problems for some restricted classes of geometric objects
- Searching 2D-strings for matching frames
- Chromatic k-nearest neighbor queries
- String 2-covers with no length restrictions
- Improved girth approximation in weighted undirected graphs
- Convexity helps iterated search in 3D
- Core-sparse Monge matrix multiplication: improved algorithm and applications
- Compact and succinct data structures for multidimensional orthogonal range searching
- Non-orthogonal homothetic range partial-sum query on integer grids (extended abstract)
- Multivariate analysis of orthogonal range searching and graph distances
- New trie data structures which support very fast search operations
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- The \(k\)-means range algorithm for personalized data clustering in e-commerce
- Dynamic fractional cascading
- Parallel general prefix computations with geometric, algebraic, and other applications
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)
