On the cost of fixed partial match queries in \(K\)-d trees (Q308949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the cost of fixed partial match queries in K-d trees |
scientific article; zbMATH DE number 6624131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the cost of fixed partial match queries in \(K\)-d trees |
scientific article; zbMATH DE number 6624131 |
Statements
On the cost of fixed partial match queries in \(K\)-d trees (English)
0 references
6 September 2016
0 references
multidimensional search
0 references
partial match search
0 references
\(K\)-dimensional search trees
0 references
analysis of algorithms
0 references
multidimensional data structures
0 references
0 references
0 references
0.9269400238990784
0 references
0.8879651427268982
0 references
0.8854404091835022
0 references
0.8825844526290894
0 references
0.864591121673584
0 references
