A Low Overhead Index Structure for Dynamic Main Memory Database Management Systems

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, an effective index structure for dynamic main memory database systems, which we call the T^2-tree, is presented. A notion of a thread pointer is introduced to overcome some of the limitations of the T-tree and the T^*-tree. There are several advantages to this structure. First, the T^2-tree reduces the number of rotate operations and the overhead required for balancing the tree by restraining new node creation and deletion. Second, the T^2-tree shows good performance for sequential search of range queries as these requests can be effectively handled using the successor pointer. Finally, the T^2-tree allows for higher space utilization amplicating the aforementioned benefits. These advantages are obtained with minimal changes to the existing T-tree structure. Experimental studies showing evidence of the benefits of the T^2-tree are also presented.

• 社団法人電子情報通信学会の論文
• 2001-09-01

著者

• Kim Tae

  With The Department Of Computer Engineering Hong-ik University

• JEON Heung

  with the Department of Computer Engineering, Hong-Ik University

• NOH Sam

  with the Department of Computer Engineering, Hong-Ik University

• LEE Jaeho

  with the Department of Computer Education, Inchon National University of Education

• LIM Hae

  with the Department of Computer Engineering, Hong-Ik University

• Lim H

  Hong‐ik Univ. Seoul Kor

• Lee Jaeho

  With The Department Of Computer Education Inchon National University Of Education

• Noh Sam

  With The Department Of Computer Engineering Hong-ik University

• Jeon H

  Konkuk Univ. Chungbuk‐do Kor

関連論文

• A Low Overhead Index Structure for Dynamic Main Memory Database Management Systems

スポンサーリンク