Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Böhm, C., Berchtold, S., Keim, D.: Searching in High-Dimensional Spaces – Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys 33(3), 322–373 (2001)
Brinkhoff, T.: A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems. In: Jensen, C.S., Jeffery, K.G., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 533–552. Springer, Heidelberg (2002)
Carson, S.D.: A system for adaptive disk rearrangement. Software - Practice and Experience (SPE) 20(3), 225–242 (1990)
Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Computing Surveys 33(3), 273–321 (2001), doi:10.1145/502807.502808
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB’97, pp. 426–435 (1997)
Corral, A., Vassilakopoulos, M., Manolopoulos, Y.: The Impact of Buffering on Closest Pairs Queries Using R-Trees. In: Caplinskas, A., Eder, J. (eds.) ADBIS 2001. LNCS, vol. 2151, pp. 41–54. Springer, Heidelberg (2001)
Effelsberg, W., Haerder, T.: Principles of database buffer management. ACM Transastions on Database Systems (TODS) 9(4), 560–595 (1984), doi:10.1145/1994.2022
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998), doi:10.1145/280277.280279
Hettich, S., Bay, S.: The UCI KDD archive (1999), http://kdd.ics.uci.edu
Huang, H., Hung, W., Shin, K.G.: FS2: dynamic data replication in free disk space for improving disk performance and energy consumption. In: ACM SOSP ’05, Brighton, United Kingdom, pp. 263–276. ACM Press, New York (2005), doi:10.1145/1095810.1095836
Leutenegger, S.T., Lopez, M.A.: The Effect of Buffering on the Performance of R-Trees. IEEE Transaction on Knowledge and Data Engineering 12(1), 33–44 (2000), doi:10.1109/69.842248
Mackert, L.F., Lohman, G.M.: Index scans using a finite LRU buffer: a validated I/O model. ACM Transactions on Database Systems (TODS) 14(3), 401–424 (1989), doi:10.1145/68012.68016
Ng, R.T., Faloutsos, C., Sellis, T.K.: Flexible buffer allocation based on marginal gains. In: ACM SIGMOD, pp. 387–396. ACM Press, New York (1991)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: ACM SIGMOD, Washington, D.C., United States, pp. 297–306. ACM Press, New York (1993), doi:10.1145/170035.170081
Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw-Hill, New York (2003)
Ruemmler, C., Wilkes, J.: Disk Shuffling. Technical Report HPL-CSP-91-30, Hewlett-Packard Laboratories (1991)
Schlosser, S.W., Schindler, J., Papadomanolakis, S., Shao, M., Ailamaki, A., Faloutsos, C., Granger, G.R.: On multidimensional data and modern disks. In: 4th USENIX Conference on File and Storage Technologies, pp. 225–238 (2005)
Skopal, T., Pokorný, J., Snášel, V.: Nearest Neighbours Search Using the PM-Tree. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 803–815. Springer, Heidelberg (2005)
Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys 33(2), 209–271 (2001), citeseer.ist.psu.edu/vitter01external.html
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB ’98, pp. 194–205. Morgan Kaufmann, San Francisco (1998)
Yu, B., Kim, S.H.: An efficient zoning technique for multi-dimensional access methods. In: Draheim, D., Weber, G. (eds.) TEAA 2005. LNCS, vol. 3888, pp. 129–143. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skopal, T., Hoksza, D., Pokorný, J. (2007). Construction of Tree-Based Indexes for Level-Contiguous Buffering Support. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)