On the cost of fixed partial match queries in K-d trees

DOI10.1007/S00453-015-0097-4MaRDI QIDQ308949zbMATH OpenOpenAlexWikidataFDO

Authors Amalia Duch, Gustavo Lau, Conrado Martínez

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

zbMATH Keywords

analysis of algorithms\(K\)-dimensional search treesmultidimensional data structuresmultidimensional searchpartial match search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• Fixed partial match queries in quadtrees
• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
• Random partial match in quad-\(K\)-d trees
• Partial match queries in relaxed \(K\)-\(\mathrm{d}t\) trees
• Partial match queries in random quadtrees

Cites work

• scientific article; zbMATH DE number 140456 (Why is no real title available?)
• scientific article; zbMATH DE number 273667 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A limit process for partial match queries in random quadtrees and 2-d trees
• Analysis of range search for random \(k-d\) trees
• Analytic combinatorics
• Multidimensional binary search trees used for associative searching
• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
• On the average performance of orthogonal range search in multidimensional data structures
• Partial Match Queries in Random k-d Trees
• Partial match queries in relaxed multidimensional search trees
• Partial match queries in two-dimensional quadtrees: a probabilistic approach
• Partial match retrieval of multidimensional data
• Quad trees: A data structure for retrieval by composite keys
• Selection by rank in K-dimensional binary search trees
• Singularity Analysis of Generating Functions
• Squarish \(k\)-\(d\) trees

Cited in

(8)

• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
• Random partial match in quad-\(K\)-d trees
• Fixed partial match queries in quadtrees
• scientific article; zbMATH DE number 4014072 (Why is no real title available?)
• Partial match queries in relaxed \(K\)-\(\mathrm{d}t\) trees
• Partial match queries in relaxed multidimensional search trees
• On the expected cost of partial match queries in random quad-\(K\)-d trees
• Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries

This page was built for publication: On the cost of fixed partial match queries in \(K\)-d trees

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