In this paper, we present the results from an extensive comparison study of three R-tree packing algorithms, including a new easy to implement algorithm. Our studies also consider the impact that various degrees of buffering have on query performance.
Experimental results incidate that none of the algorithms is best for all types of data.
In general, our new algorithm requires up to 50 previously proposed algorithm for point and region queries on uniformly distributed or mildly skewed point and region data, and approximately the same for highly skewed point and region data. How to view this document Display the whole document in one of the following formats. PostScript 436597 bytes.