Partial Match Queries in Random k-d Trees

DOI10.1137/S0097539703437491zbMath1116.68029MaRDI QIDQ5470740

Hsien-Kuei Hwang, Hua-Huai Chern

Publication date: 1 June 2006

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

zbMATH Keywords

differential equationsasymptotic analysisaverage-case analysis of algorithmspartial match queriesk-d treesmethod of linear operators

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Selection by rank inK-dimensional binary search trees

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