Bulk-insertions into R-trees using the small-tree-large-tree approach
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
A greedy algorithm for bulk loading R-trees
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Indexing medium-dimensionality data in Oracle
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Post-optimization and incremental refinement of R-trees
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Efficient content-based indexing of large image databases
ACM Transactions on Information Systems (TOIS)
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Finding similar images quicky using object shapes
Proceedings of the tenth international conference on Information and knowledge management
Maintaining a large spatial database with T2SM
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
On Optimal Node Splitting for R-trees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
Revisiting R-Tree Construction Principles
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
The BASIS System: A Benchmarking Approach for Spatial Index Structures
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Efficient Processing of Large Spatial Queries Using Interior Approximations
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Declustering Spatial Objects by Clustering for Parallel Disks
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Boolean Bounding Predicates for Spatial Access Methods
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures
Handbook of massive data sets
A distance-based packing method for high dimensional data
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Information Systems - Databases: Creation, management and utilization
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Spatial queries in wireless broadcast systems
Wireless Networks - Special issue: Pervasive computing and communications
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
Trajectory Indexing Using Movement Constraints
Geoinformatica
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient query processing on unstructured tetrahedral meshes
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Bulk insertion for R-trees by seeded clustering
Data & Knowledge Engineering
Image retrieval based on indexing and relevance feedback
Pattern Recognition Letters
On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems
IEEE Transactions on Mobile Computing
Range search on multidimensional uncertain data
ACM Transactions on Database Systems (TODS)
Data & Knowledge Engineering
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Multi-point queries in large spatial databases
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The priority R-tree: A practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms (TALG)
Zoned-partitioning of tree-like access methods
Information Systems
Efficient data dissemination using locale covers
Pervasive and Mobile Computing
Processing transitive nearest-neighbor queries in multi-channel access environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Predictive Skyline Queries for Moving Objects
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
A distributed spatial index for error-prone wireless data broadcast
The VLDB Journal — The International Journal on Very Large Data Bases
Density-based clustering using graphics processors
Proceedings of the 18th ACM conference on Information and knowledge management
A New Point Access Method Based on Wavelet Trees
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
Hierarchical clustering-merging for multidimensional index structures
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
On processing location based top-k queries in the wireless broadcasting system
Proceedings of the 2010 ACM Symposium on Applied Computing
Efficient index support for view-dependent queries on CFD data
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Index structures for data warehouses
Index structures for data warehouses
Bulk-loading the ND-tree in non-ordered discrete data spaces
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Detecting outliers on arbitrary data streams using anytime approaches
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
On the selectivity of multidimensional routing indices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A fun application of compact data structures to indexing geographic data
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Four-dimensional hilbert curves for R-trees
Journal of Experimental Algorithmics (JEA)
A Fast Location Service for Partial Spatial Replicas
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
Finding data broadness via generalized nearest neighbors
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Bulkloading updates for moving objects
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Bulk loading hierarchical mixture models for efficient stream classification
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
DCF: an efficient data stream clustering framework for streaming applications
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
A forced transplant algorithm for dynamic r-tree implementation
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Scalable continuous query processing and moving object indexing in spatio-temporal databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
An efficient zoning technique for multi-dimensional access methods
TEAA'05 Proceedings of the 31st VLDB conference on Trends in Enterprise Application Architecture
Spatial indexing for massively update intensive applications
Information Sciences: an International Journal
Efficient distributed query processing for autonomous RDF databases
Proceedings of the 15th International Conference on Extending Database Technology
A probabilistic convex hull query tool
Proceedings of the 15th International Conference on Extending Database Technology
SCOUT: prefetching for latent structure following queries
Proceedings of the VLDB Endowment
SIGSPATIAL Special
A hilbert space compression architecture for data warehouse environments
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Robust distributed indexing for locality-skewed workloads
Proceedings of the 21st ACM international conference on Information and knowledge management
Sort-based query-adaptive loading of R-trees
Proceedings of the 21st ACM international conference on Information and knowledge management
Sort-based parallel loading of R-trees
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Accelerating spatial range queries
Proceedings of the 16th International Conference on Extending Database Technology
Data-driven neuroscience: enabling breakthroughs via innovative data management
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
TOUCH: in-memory spatial join by hierarchical data-oriented partitioning
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
GIPSY: joining spatial datasets with contrasting density
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Efficient top-k spatial distance joins
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
PL-Tree: an efficient indexing method for high-dimensional data
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Parallel spatial query processing on GPUs using R-trees
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
MR-DBSCAN: a scalable MapReduce-based DBSCAN algorithm for heavily skewed data
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
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 indicate that none of the algorithms is best for all types of data. In general, our new algorithm requires up to 50\% fewer disk accesses than the best 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.