Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
Overview of DBMS: a high performance database management system
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
Twin grid files: space optimizing access schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A qualitative comparison study of data structures for large line segment databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Searching spatial objects with index by dimensional projections
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Storage management for knowledge bases
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hashing by proximity to process duplicates in spatial databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance evaluation of G-tree and its application in fuzzy databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Self-spacial join selectivity estimation using fractal concepts
ACM Transactions on Information Systems (TOIS)
Multidimensional access methods
ACM Computing Surveys (CSUR)
Simple QSF-trees: an efficient and scalable spatial access method
Proceedings of the eighth international conference on Information and knowledge management
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Modeling high-dimensional index structures using sampling
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
ACM Computing Surveys (CSUR)
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Management of multidimensional discrete data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
The Implementation of POSTGRES
IEEE Transactions on Knowledge and Data Engineering
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
An Efficient Pictorial Database System for PSQL
IEEE Transactions on Software Engineering
On R-trees with low query complexity
Computational Geometry: Theory and Applications
Toward an Accurate Analysis of Range Queries on Spatial Data
IEEE Transactions on Knowledge and Data Engineering
Dynamically Optimizing High-Dimensional Index Structures
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
V-Trees - A Storage Method for Long Vector Data
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
On R-trees with Low Stabbing Number
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Techniques for Design and Implementation of Efficient Spatial Access Methods
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Energy efficient exact kNN search in wireless broadcast environments
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Cost models for distance joins queries using R-trees
Data & Knowledge Engineering
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
A cost model for an adaptive cell-based index structure
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Probabilistic cost model for nearest neighbor search in image retrieval
Computer Vision and Image Understanding
| Hi-index | 0.00 |
This paper provides an analysis of R-trees and a variation (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree. The main contributions of the paper are the following. We provide the first known analysis of R-trees. Although formulas are given for objects in one dimension (line segments), they can be generalized for objects in higher dimensions as well. We show how the transformation of objects to higher dimensions [HINR83] can be effectively used as a tool for the analysis of R- and R+- trees. Finally, we derive formulas for R+-trees and compare the two methods analytically. The results we obtained show that R+-trees require less than half the disk accesses required by a corresponding R-tree when searching files of real life sizes R+-trees are clearly superior in cases where there are few long segments and a lot of small ones.