On the cost of fixed partial match queries in \(K\)-d trees
type: Item
instance of: scholarly article
title: On the cost of fixed partial match queries in \(K\)-d trees
zbMATH Open document ID: 1350.68067
author: Amalia Duch
author: Gustavo Lau
author: Conrado Martínez
published in: Algorithmica
publication date: 2016-09-06T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6624131
zbMATH Keywords: multidimensional search
zbMATH Keywords: partial match search
zbMATH Keywords: \(K\)-dimensional search trees
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: multidimensional data structures
Wikidata QID: Q61734770
MaRDI profile type: Publication
full work available at URL: s00453-015-0097-4
OpenAlex ID: W2330821553
cites work: Multidimensional binary search trees used for associative searching
cites work: Quad trees: A data structure for retrieval by composite keys
cites work: A limit process for partial match queries in random quadtrees and 2-d trees
cites work: Analysis of range search for random \(k-d\) trees
cites work: Partial Match Queries in Random k-d Trees
cites work: Partial match queries in two-dimensional quadtrees: a probabilistic approach
cites work: Q4028872
cites work: Selection by rank in K-dimensional binary search trees
cites work: Squarish \(k\)-\(d\) trees
cites work: On the average performance of fixed partial match queries in random relaxed \(K\)-d trees
cites work: On the average performance of orthogonal range search in multidimensional data structures
cites work: Q5624436
cites work: Singularity Analysis of Generating Functions
cites work: Partial match retrieval of multidimensional data
cites work: Q3549563
cites work: Q5288997
cites work: Partial match queries in relaxed multidimensional search trees
DOI: 10.1007/S00453-015-0097-4
description: scientific article; zbMATH DE number 6624131