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.
Cited By
- Fang J and Zhang Z (2023). A Distributed Spatial Index With High Update Efficiency for Location-Based Real-Time Services, Journal of Database Management, 34:1, (1-28), Online publication date: 21-Apr-2023.
Xie D, Phillips J, Matheny M and Li F Spatial Independent Range Sampling Proceedings of the 2021 International Conference on Management of Data, (2023-2035)- Evagorou G and Heinis T MAMBO - Indexing Dead Space to Accelerate Spatial Queries✱ Proceedings of the 33rd International Conference on Scientific and Statistical Database Management, (73-84)
- Garcia-Garcia F, Corral A and Iribarne L Including the Quadtree index in SpatialHadoop Proceedings of the 24th Pan-Hellenic Conference on Informatics, (376-379)
- Qi J, Tao Y, Chang Y and Zhang R (2018). Theoretically optimal and empirically efficient r-trees with strong parallelizability, Proceedings of the VLDB Endowment, 11:5, (621-634), Online publication date: 1-Jan-2018.
- Qi J, Tao Y, Chang Y and Zhang R (2018). Theoretically optimal and empirically efficient r-trees with strong parallelizability, Proceedings of the VLDB Endowment, 11:5, (621-634), Online publication date: 1-Jan-2018.
- Sabek I and Mokbel M On Spatial Joins in MapReduce Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (1-10)
- Wang Z, Vo H, Salehi M, Rusu L, Reeves C and Phan A A large-scale spatio-temporal data analytics system for wildfire risk management Proceedings of the Fourth International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data, (1-6)
- Xie D, Li F, Yao B, Li G, Chen Z, Zhou L and Guo M Simba Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (1-4)
- Mahesh Kumar K and Rama Mohan Reddy A (2016). A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method, Pattern Recognition, 58:C, (39-48), Online publication date: 1-Oct-2016.
- Xie D, Li F, Yao B, Li G, Zhou L and Guo M Simba Proceedings of the 2016 International Conference on Management of Data, (1071-1085)
- Simion B, Ilha D, Brown A and Johnson R The price of generality in spatial indexing Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, (8-12)
- Yan D, Zhao Z and Ng W Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces Proceedings of the 21st ACM international conference on Information and knowledge management, (942-951)
- Singh V, Bhattacharya A and Singh A Querying spatial patterns Proceedings of the 13th International Conference on Extending Database Technology, (418-429)
- Ghinita G, Zhao K, Papadias D and Kalnis P (2010). A reciprocal framework for spatial K-anonymity, Information Systems, 35:3, (299-314), Online publication date: 1-May-2010.
- Tao Y, Xiao X and Cheng R (2007). Range search on multidimensional uncertain data, ACM Transactions on Database Systems, 32:3, (15-es), Online publication date: 1-Aug-2007.
- Venkateswaran J and Subramanya S Schemes for SR-Tree packing Proceedings of the 2006 ACM symposium on Applied computing, (73-77)
- Chen Z, Cong G and Aref W STAR: A Cache-based Stream Warehouse System for Spatial Data, ACM Transactions on Spatial Algorithms and Systems, 0:0
Recommendations
Online bin packing with (1,1) and (2,$$R$$R) bins
We study a variant of online bin packing problem, in which there are two types of bins: $$(1,1)$$(1,1) and $$(2,R)$$(2,R), i.e., unit size bin with cost 1 and size 2 bin with cost $$R > 1$$R>1, the objective is to minimize the total cost occurred when ...
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97: Proceedings of the Thirteenth International Conference on Data EngineeringIn 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 ...