On R-trees with low query complexity (Q1869749)
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 R-trees with low query complexity |
scientific article; zbMATH DE number 1902838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On R-trees with low query complexity |
scientific article; zbMATH DE number 1902838 |
Statements
On R-trees with low query complexity (English)
0 references
28 April 2003
0 references
computational geometry
0 references
data structure
0 references
R-tree
0 references
bounding-volume hiearchy
0 references
spatial access method
0 references
0.8733612895011902
0 references
0.8733611106872559
0 references
0.8127933144569397
0 references
0.809333860874176
0 references
