Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(2):243-250; doi:10.1093/ietisy/e91-d.2.243
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by YEO, M. H.
Right arrow Articles by YOO, J. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Database

The Optimization of In-Memory Space Partitioning Trees for Cache Utilization

Myung Ho YEO1, Young Soo MIN2, Kyoung Soo BOK3 and Jae Soo YOO1

1 The authors are with the Department of Computer and Communication Engineering, Chungbuk National University, Cheongju, Korea. E-mail: yjs{at}cbnu.ac.kr, 2 The author is with Electronics and Telecommunications Research Institute (ETRI), Daejeon, Korea., 3 The author is with Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea.


  Abstract

In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.

Key Words: cache conscious, in-memory, index structure, KDB-tree

Manuscript received April 6, 2007. Manuscript revised September 1, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.