Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2004.11D.1.011

Design and Implementation of a Main-Memory Database System for Real-time Mobile GIS Application  

Kang, Eun-Ho (홍익대학교 대학원 컴퓨터공학과)
Yun, Suk-Woo (홍익대학교 대학원 컴퓨터공학과)
Kim, Kyung-Chang (홍익대학교 컴퓨터공학과)
Abstract
As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules: the interface manager provides the interface for PDA users; the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques; the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.
Keywords
Main-memory Database; Interface Manager; Memory Data Manager; Query Processor; Index Manager; Spatial Index; Non-Spatial Index; Spatial Query; Non-Spatial Query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L.Felician and A.Gentili, 'A nearly optimal Huffman technique in the microcomputer environment,' Inf. Sys. 12, 4, 37, 1987   DOI   ScienceOn
2 R.G.Gallager, Variations on a Theme by Huffman, IEEE Trans. on Inf. Theory IT-24, 6, 66, 1978
3 Bohannon,P., D.Lieuwen, R.Rastogi, A.Silberschatz and S.Sudarshan, 'The Architecture of the Dali Main Memory Storage Manager,' The International Journal on Multimedia Tools and pplications, 4, 2, March, 1997   DOI   ScienceOn
4 Tobin J. Lehman, Michael J. Carey, 'A Study of Index Structures for Main Memory Database Management Systems,' Procedings 12th Int'l. conf. on Very Large Databases, kyoyo, pp294-303, Aug., 1986
5 Tobin J. Lehman, Eugene J. Shekita, 'An Evaluation of Starburst's Memory Resident Storage Componet,' IEEE Trans. on Knowlege and Data Engineering, Vol.4, December, 1992   DOI   ScienceOn
6 A.Ailamaki, D.J.DeWitt, M.D.Hill and D.A.Wood, 'DBM Ss on a Modern Processor : Where Does Time Go?,' Proceedings of VLDB Conference, pp.267-277, 1999
7 K. Kim, S.K. and Cha, K. Kwon, 'Optimizing Multidimentsional Index Trees for Main Memory Access,' Proceedings of ACM SIGMOD Conference, pp.139-150, 2001   DOI
8 Trishul M. Chilimbi, Mark D. Hill and James R. Larus, 'Making Pointer-Based Data Structures Cache Conscious,' IEEE Computer, TBD, pp.67-74, 2000   DOI   ScienceOn
9 P.Bones, S.Manegold and M.Kersten, 'Database Architecture Opimized for the New Bottleneck : Memory Access,' Proceedings of VLDB Conference, pp.54-65
10 J.Rao and K.A.Ross, 'Cache Conscious Indexing for Decision-support in Main Memory,' Proceedings of VLDB Conference, pp.78-89, 1999
11 A.Guttman, 'R-tree : A Dynamic Index Structure for Spatial Searching,' Proceedings of ACM SIGMOD Conference, pp.47-57, 1984   DOI
12 Phi Bernstein et al., 'The Asilomar report on database research,' Sigmod Record, 27(4), 1998   DOI
13 H.V.Jagadish, Daniel Lieuwen, Rajeev Rastogi, Avi Silberschatz, 'Dali : A High Performance Main Memory Storage Manager,' Proc. of the 20th conf. on VLDB, Santiago, Chile, 1994
14 J.Rao, K.A.Ross, 'Making B+-trees Cache Conscious in Main Memory,' Proceedings of ACM SIGMOD Conference, pp.475-486, 2000   DOI