Proceedings of the 2006 ACM symposium on Applied computing
A reciprocal framework for spatial K-anonymity
Information Systems
Proceedings of the 13th International Conference on Extending Database Technology
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
Proceedings of the 21st ACM international conference on Information and knowledge management
The price of generality in spatial indexing
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
An experimental analysis of iterated spatial joins in main memory
Proceedings of the VLDB Endowment
| Hi-index | 0.02 |
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. The algorithms are evaluated using both synthetic and actual data from various application domains including VLSI design, GIS (tiger), and computational fluid dynamics. 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.