On the average performance of orthogonal range search in multidimensional data structures (Q4799528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1886738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the average performance of orthogonal range search in multidimensional data structures |
scientific article; zbMATH DE number 1886738 |
Statements
On the average performance of orthogonal range search in multidimensional data structures (English)
0 references
23 March 2003
0 references
orthogonal range search
0 references
multidimensional data structures
0 references
multidimensional
0 references
search
0 references
partial match search
0 references
\(K-d\) trees
0 references
quadtrees
0 references
average-case analysis
0 references
0.8122029304504395
0 references
0.7834327816963196
0 references
