On the average performance of fixed partial match queries in random relaxed \(K\)-d trees (Q2789547)
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 average performance of fixed partial match queries in random relaxed \(K\)-d trees |
scientific article; zbMATH DE number 6547933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the average performance of fixed partial match queries in random relaxed \(K\)-d trees |
scientific article; zbMATH DE number 6547933 |
Statements
1 March 2016
0 references
partial match
0 references
\(K\)-d trees
0 references
multidimensional data structures
0 references
associative queries
0 references
On the average performance of fixed partial match queries in random relaxed \(K\)-d trees (English)
0 references
