Performance comparison of point and spatial access methods
SSD '90 Proceedings of the first symposium on Design and implementation of large spatial databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we describe an experimental examination of a well-known group of multidimensional access methods, called the R-tree group. The test environment aimed at investigating how the performance of such access methods is affected by factors such as datasets volume scalability, disk page size and the area of non-zero size objects. The workload was composed of point queries, intersection and containment range queries. Moreover, we analyzed the efficiency of initial indexing structure building. We based our comparison mainly on the number of disk accesses.