The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
An advancing front Delaunay triangulation algorithm designed for robustness
Journal of Computational Physics
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
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
The Effect of Buffering on the Performance of R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Simple Analysis of the LRU Buffer Policy and Its Relationship to Buffer Warm-Up Transient
Proceedings of the Ninth International Conference on Data Engineering
On Optimal Node Splitting for R-trees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A cost model for spatio-temporal queries using the TPR-tree
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
A web-based spatial data access system using semantic R-trees
Information Sciences—Informatics and Computer Science: An International Journal
Cost models for distance joins queries using R-trees
Data & Knowledge Engineering
Processing partially specified queries over high-dimensional databases
Data & Knowledge Engineering
Zoned-partitioning of tree-like access methods
Information Systems
Construction of tree-based indexes for level-contiguous buffering support
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
An efficient zoning technique for multi-dimensional access methods
TEAA'05 Proceedings of the 31st VLDB conference on Trends in Enterprise Application Architecture
| Hi-index | 0.00 |
Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the number of disk accesses is a more realistic measure of performance. We develop a buffer model to analyze the number of disk accesses required for spatial queries using R-trees. The model can be used to evaluate the quality of R-tree update operations, such as various node splitting and tree restructuring policies, as measured by query performance on the resulting tree. We use our model to study the performance of three well-known R-tree loading algorithms. We show that ignoring buffer behavior and using number of nodes accessed as a performance metric can lead to incorrect conclusions, not only quantitatively, but also qualitatively. In addition, we consider the problem of how many levels of the R-tree should be pinned in the buffer.