Partial Match Queries in Random k-d Trees

DOI10.1137/S0097539703437491MaRDI QIDQ5470740zbMATH OpenFDO

Authors Hsien-Kuei Hwang, Hua-Huai Chern

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539703437491

zbMATH Keywords

asymptotic analysisaverage-case analysis of algorithmsdifferential equationsk-d treesmethod of linear operatorspartial match queries

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• Partial Match Queries in Random Quadtrees
• scientific article; zbMATH DE number 1545682
• Partial match queries in relaxed \(K\)-\(\mathrm{d}t\) trees
• Partial match queries in random quadtrees
• On the average performance of fixed partial match queries in random relaxed K-d trees

Cited in

(13)

• A limit field for orthogonal range searches in two-dimensional random point search trees
• Random partial match in quad-K-d trees
• Selection by rank in K-dimensional binary search trees
• On the cost of fixed partial match queries in K-d trees
• A limit process for partial match queries in random quadtrees and 2-d trees
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• scientific article; zbMATH DE number 1545682 (Why is no real title available?)
• scientific article; zbMATH DE number 1545683 (Why is no real title available?)
• Partial Match Queries in Random Quadtrees
• Partial match retrieval of multidimensional data
• Analysis of range search for random \(k-d\) trees
• On the expected cost of partial match queries in random quad-K-d trees
• Quad-k d trees: a general framework for k d trees and quad trees

This page was built for publication: Partial Match Queries in Random k-d Trees

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