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

DOI10.1007/S00453-015-0097-4zbMATH Open1350.68067OpenAlexW2330821553WikidataQ61734770 ScholiaQ61734770MaRDI QIDQ308949FDOQ308949

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

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

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)

Cites Work

• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Singularity Analysis of Generating Functions
• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• Partial match queries in relaxed multidimensional search trees
• Squarish \(k\)-\(d\) trees
• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
• Selection by rank in K-dimensional binary search trees
• Partial match queries in two-dimensional quadtrees: a probabilistic approach
• A limit process for partial match queries in random quadtrees and 2-d trees
• Title not available (Why is that?)
• 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

Cited In (8)

• Fixed partial match queries in quadtrees
• Random partial match in quad-\(K\)-d trees
• Title not available (Why is that?)
• Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries
• Partial match queries in relaxed \(K\)-\(\mathrm{d}t\) trees
• Partial match queries in relaxed multidimensional search trees
• On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
• On the expected cost of partial match queries in random quad-\(K\)-d trees

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)