An implementation and performance analysis of spatial data access methods

Author

Greene, Diane

Author_Institution

Dept. of Comput. Sci., California Univ., Berkeley, CA, USA

fYear

1989

fDate

6-10 Feb 1989

Firstpage

606

Lastpage

615

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

computer graphics; database management systems; information retrieval systems; performance evaluation; 2-D-Isam; CPU time; K-D-B-trees; POSTGRES DBMS; R+trees; R-trees; database management system; implementation complexity; logical page sizes; performance analysis; retrieve operations; spatial data access methods; tree sizes; two-dimensional objects; Contracts; Costs; Information retrieval; Logic testing; Monitoring; Performance analysis; Performance evaluation; Shape; Solids; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1989. Proceedings. Fifth International Conference on

Conference_Location

Los Angeles, CA

Print_ISBN

0-8186-1915-5

Type

conf

DOI

10.1109/ICDE.1989.47268

Filename

47268