Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
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
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
PROBE Spatial Data Modeling and Query Processing in an Image Database Application
IEEE Transactions on Software Engineering
The Effect of Buffering on the Performance of R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Adaptive Database Buffer Allocation Using Query Feedback
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
An evaluation of buffer management strategies for relational database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
A spatial hash join algorithm suited for small buffer size
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Query optimizer for spatial join operations
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic 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 incremental approach to closest pair queries in spatial networks using best-first search
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
BEAST: a buffer replacement algorithm using spatial and temporal locality
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
BRUST: an efficient buffer replacement for spatial databases
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
| Hi-index | 0.00 |
For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed and compared for standard database systems. In the context of spatial database systems, however, the impact of buffing techniques has not been considered in detail, yet. In this paper, different page-replacement algorithms are compared for performing spatial queries. This study includes well-known techniques like LRU and LRU-K as well as new algorithms observing spatial optimization criteria. Experiments show that spatial page-replacement algorithms outperform LRU buffers for many distributions, but not for all investigated query sets. Therefore, a combination of spatial page-replacement strategies with LRU strategies is proposed and experimentally investigated. An algorithm is presented, which is self-tuning and adapts itself to different or changing query distributions. This adaptable spatial buffer outperforms LRU in respect to the I/O-cost by performance gains of up to 25%.