Abstract
Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees, and minimize the number of cache misses. They can be classified into two approaches according to their space reduction methods. One approach is to compress minimum bounding regions (MBRs) by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of MBRs that are different from their parents. In this paper, we investigate the existing multi-dimensional index structures for main memory database systems through experiments under the various work loads. Then, we propose a new index structure that exploits the properties of the both techniques. We implement existing multi-dimensional index structures and the proposed index structure, and perform various experiments to show that our approach outperforms others.
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
Ailamaki, A., DeWitt, D.J., Hill, M.D., Wood, D.A.: DBMSs on a Modern Processor: Where Does Time Go? In: Proceedings of VLDB Conference, pp. 266–277 (1999)
Manegold, S., Boncz, P.A., Kersten, M.L.: Optimizing database architecture for the new bottleneck: memory access. VLDB Journal 9(3), 231–246 (2000)
Rao, J., Ross, K.A.: Cache Conscious Indexing for Decision-Suppoert in Main Memory. In: Proceedings of VLDB Conference, pp. 78–79 (1999)
Rao, J., Ross, K.A.: Making B+-trees Cache Conscious in Main Memory. In: Proceedings of ACM SIGMOD Conference, pp. 475–486 (2000)
Bohannon, P., Mcllroy, P., Rastogi, R.: Main-Memory Index Structures with Fixed-Size Partial Keys. In: Proceedings of ACM SIGMOD Conference, pp. 163–174 (2001)
Chen, S., Gibbons, P.B., Mowry, T.C.: Improving Index Performance through Prefetching. In: Proceedings of ACM SIGMOD Conference, pp. 235–246 (2001)
Kim, K., Cha, S.K., Kwon, K.: Optimizing Multidimensional Index trees for Main Memory Access. In: Proceeding of ACM SIGMOD Conference, pp. 139–150 (2001)
Sitzmann, I., Stuckey, P.J.: Compacting discriminator information for spatial trees. In: Proceedings of the Thirteenth Australasian Database Conference, pp. 167–176 (2002)
Guttman, A.: R-trees: a Dynamic Index Structure for Spatial Searching. In: Proceedings of ACM SIGMOD Conference, pp. 47–47 (1984)
Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: STR: A Simple and Efficient Algorithm for R-tree Packing. In: Proceedings of ICDE Conference, pp. 497–506 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shim, J.M., Song, S.I., Min, Y.S., Yoo, J.S. (2004). An Efficient Cache Conscious Multi-dimensional Index Structure. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_93
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive