Fixed Partial Match Queries in Quadtrees

DOI10.4230/LIPIcs.AofA.2018.20zbMath1478.68068OpenAlexW2910312071MaRDI QIDQ4993542

Gustavo Lau, Amalia Duch, Conrado Martínez

Publication date: 15 June 2021

Full work available at URL: https://upcommons.upc.edu/bitstream/2117/122772/1/LIPIcs-AofA-2018-20.pdf

zbMATH Keywords

quadtreeanalysis of algorithmsmultidimensional searchpartial match queriesassociative queries

Mathematics Subject Classification ID

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

Related Items (1)

On the expected cost of partial match queries in random quad-\(K\)-d trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the cost of fixed partial match queries in \(K\)-d trees
• Analytic variations on quadtrees
• Partial match queries in two-dimensional quadtrees: a probabilistic approach
• Partial Match Queries in Random Quadtrees
• Partial Match Queries in Relaxed K-dt trees
• Partial match queries in random quadtrees

This page was built for publication: Fixed Partial Match Queries in Quadtrees