Principles of database buffer management
ACM Transactions on Database Systems (TODS)
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
A system for adaptive disk rearrangement
Software—Practice & Experience
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Database Management Systems
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Proceedings of the twentieth ACM symposium on Operating systems principles
On multidimensional data and modern disks
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Nearest neighbours search using the PM-Tree
DASFAA'05 Proceedings of the 10th 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
Optimization of disk accesses for multidimensional range queries
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
On the efficiency of multiple range query processing in multidimensional data structures
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
In multimedia databases, the spatial index structures based on trees (like R-tree, M-tree) have been proved to be efficient and scalable for low-dimensional data retrieval. However, if the data dimensionality is too high, the hierarchy of nested regions (represented by the tree nodes) becomes spatially indistinct. Hence, the query processing deteriorates to inefficient index traversal (in terms of random-access I/O costs) and in such case the tree-based indexes are less efficient than the sequential search. This is mainly due to repeated access to many nodes at the top levels of the tree. In this paper we propose a modified storage layout of tree-based indexes, such that nodes belonging to the same tree level are stored together. Such a level-ordered storage allows to prefetch several top levels of the tree into the buffer pool by only a few or even a single contiguous I/O operation (i.e. one-seek read). The experimental results show that our approach can speedup the tree-based search significantly.