Browse > Article

Making Cache-Conscious CCMR-trees for Main Memory Indexing  

윤석우 (홍익대학교 컴퓨터공학과)
김경창 (홍익대학교 정보컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.30, no.6, 2003 , pp. 651-665 More about this Journal
Abstract
To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.
Keywords
spatial database; main-memory database; spatial index; cache; MR-tree; CCMR-tree; R-tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Rao, K. A. Ross, 'Making B+-trees Cache Conscious in Main Memory,' Proceedings of ACM SIGMOD Conference, 2000, pp. 475-486
2 J. Rao, K. A. Ross, 'Cache Conscious Indexing for Decision-support in Main Memory,' Proceedings of VLDB Conference, 1999, pp. 78-89
3 Phi Bernstein, et al. 'The Asilomar report on database research,' Sigmod Record, 1998, 27(4)   DOI
4 A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood, 'DBMSs on a Modem Processor: Where Does Time Go?,' Proceedings of VLDB Conference, 1999, pp. 267-277
5 P. Bones, S. Manegold, and M. Kersten, 'Database Architecture Opimized for the New Bottleneck: Memory Access,' Proceedings of VLDB Conference, 1999, pp. 54-65
6 K. Ravi Kanth, D. Agrawal, and A. E. Abbadi, 'Indexing non-uniform spatial data,' Proceedings of IDEA, 1997, pp 289-298   DOI
7 Trishul M. Chilimbi, Mark D. Hill, and James R. La겨s, 'Making Pointer-Based Data Structures Cache Conscious,' IEEE Computer, TBD 2000 pp. 67-74   DOI   ScienceOn
8 D. A. White, R. Jain., 'Similarity Indexing with the SS-tree,' Proceedings of the Int. Conf. On Data Engineering, 1996, pp. 516-523   DOI
9 N. Katayama, S. Satoh, 'The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries,' Proceedings of ACM SIGMOD Conference, 1997, pp. 369-380   DOI
10 C. Faloutsos, I. Kamel, 'Beyond Uniformity and Independence: Anaylysis of R'-trees Using the Concept of Fractal Dimension,' Proceedings of ACM PODS Symposium, 1994, pp. 4-13   DOI
11 I. Kamel and C. Faloutsos, 'Hilbert R-tree: An Improved R-tree Using Fractals,' Proceedings of VLDB Conference, 1994, pp. 500-509
12 B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, 'Towards an analysis of range query performance in spatial data structures,' Proceedings of ACM PODS, 1993, pp. 214-221   DOI
13 J. M. Hellerstein, 'Indexing Research: Forest or Trees',' Proceedings of ACM SIGMOD Conference, 2000, pp574, Panel
14 V. Gaede and O. Gnther, 'Multidimensional Access Methods,' Computing Surveys, 30(2), 1998, pp, 170-231   DOI   ScienceOn
15 T. Sellies, N. Roussopoulos, and C. Faloutsos, 'The R+-tree: A Dynamic Index for Multidimensional Objects,' Proceedings of VLDB Conference, 1987, pp. 507-518
16 I. Kamel and C. Faloutsos, 'On Packing Rr trees,' Proceedings of ACM CIKM Conference, 1993, pp. 490-499   DOI
17 A. Guttman, 'R-tree: A Dynamic Index Structure for Spatial Searching,' Proceedings of ACM SIGMOD Conference, 1984, pp. 47-57
18 N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' Proceedings of ACM SIGMOD Conference, 1990, pp. 322-331   DOI
19 K. Kim, S. K. and, Cha, K. Kwon, 'Optimizing Multidimensional Index Trees for Main Memory Access,' Proceedings of ACM SIGMOD Conference, 2001, pp.139-150
20 Kenneth A. Ross, Inga Sizmann and Peter J. Stuckey, 'Cost-based Unbalanced R-trees,' Technical Report, CSSE, The university of Melbourne, 2000