An implementation and performance analysis of spatial data access methods
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 606-615
- https://doi.org/10.1109/icde.1989.47268
Abstract
Four spatial data access methods, R-trees, K-D-B-trees, R+trees, and 2-D-Isam, have been implemented within a preliminary version of the POSTGRES DBMS (database management system). These access methods have been tested over a range of shapes and sizes of two-dimensional objects and for a range of logical page sizes. The CPU time, number of disk reads and writes, and the resulting tree sizes have been tabulated for insert and retrieve operations. It is concluded that R-trees provide the best tradeoff between performance and implementation complexity and that choice of implementation is crucial to the performance of all the methods investigated.<>Keywords
This publication has 6 references indexed in Scilit:
- Analysis of object oriented spatial access methodsACM SIGMOD Record, 1987
- Spatial query processing in an object-oriented database systemACM SIGMOD Record, 1986
- Direct spatial search on pictorial databases using packed R-treesPublished by Association for Computing Machinery (ACM) ,1985
- The Grid FileACM Transactions on Database Systems, 1984
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- The K-D-B-treePublished by Association for Computing Machinery (ACM) ,1981