Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2005.12D.4.543

Tmr-Tree : An Efficient Spatial Index Technique in Main Memory Databases  

Yun Suk-Woo (홍익대학교 컴퓨터 공학과)
Kim Kyung-Chang (홍익대학교 컴퓨터 공학과)
Publication Information
The KIPS Transactions:PartD / v.12D, no.4, 2005 , pp. 543-552 More about this Journal
Abstract
As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.
Keywords
Main-memory Database; Spatial Index; T-tree; R-tree;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J. Rao, K.A. Ross, 'Making B＋-Tree Cache Conscious in Main Memory', ACM SIGMOD, May, 2000   DOI
2 P. Bones, S. Manegold, and M. Kersten, 'Database Architecture Optimized for the New Bottleneck: Memory Access', Procddeings of VLDB Conference, 1999, pp.54-56
3 Hongjun Lu, Yuet Yeung, Ng Zengping, 'T-Tree or B-Tree : Main Memory Database Index Structure Revisited', Australasian Database Conference, 2000   DOI
4 Tobin J. Lehman, Michael J. Carey 'A Study of Index Structures for Main Memory Database Management Systems', in Proceedings 12th Int'l. conf. on Very Large Databases, kyoto, pp.294-303, Aug., 1986
5 최공림, 김경창, 김기룡, 'T*-트리 : 주기억 데이터베이스에서의 효율적인 색인기법' 한국통신학회 논문지, 제21권 제10호, 1996   과학기술학회마을
6 T. Sellis, N. Roussopoulos, and C. Faloutsos, 'The R＋-tree: A dynamic index for multidimensional objects', In Proc. 13th Int. conference on Very Large Databases, pp.507-518, 1987
7 David J. Randy H. Katz, Frank Olken, Leonard D. Shapiro, Micheal R. Stonebraker, David Wood 'Implementation Techniques for Main Memory Database Systems', In Proc. of ACM SIGMOD, Boston, 1984   DOI
8 Guttman, A. 'R-tree: A dynamic index structure for spatial searching', In Proceedings of the ACM SIGMOD International conference on Management of data, 1984   DOI
9 N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, 'The R*-tree: An Efficient and Robust Access method for Points and Rectangles', In Proc. ACM SIGMOD International Conference on management of Data, pp.332-331, 1990   DOI
10 Voler Gaede, Oliver Gunther, 'Multidimensional access Methods', ACM Computing Surveys, Vol.30, No.2, June, 1998   DOI   ScienceOn