On the cost of fixed partial match queries in \(K\)-d trees
From MaRDI portal
Publication:308949
DOI10.1007/S00453-015-0097-4zbMath1350.68067OpenAlexW2330821553WikidataQ61734770 ScholiaQ61734770MaRDI QIDQ308949
Gustavo Lau, Conrado Martínez, Amalia Duch
Publication date: 6 September 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0097-4
analysis of algorithms\(K\)-dimensional search treesmultidimensional data structuresmultidimensional searchpartial match search
Related Items (2)
On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Fixed Partial Match Queries in Quadtrees
Cites Work
- A limit process for partial match queries in random quadtrees and 2-d trees
- Quad trees: A data structure for retrieval by composite keys
- Partial match queries in relaxed multidimensional search trees
- Squarish k-d Trees
- Selection by rank inK-dimensional binary search trees
- Partial match queries in two-dimensional quadtrees: a probabilistic approach
- Singularity Analysis of Generating Functions
- Multidimensional binary search trees used for associative searching
- On the average performance of orthogonal range search in multidimensional data structures
- Partial match retrieval of multidimensional data
- Partial Match Queries in Random k-d Trees
- Analysis of range search for random \(k-d\) trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the cost of fixed partial match queries in \(K\)-d trees
