Author

Huang

Date of Award

4-2008

Degree Name

Master of Science in Engineering

Department

Computer Science

First Advisor

Dr. Li Yang

Second Advisor

Dr. Ajay Gupta

Third Advisor

Dr. Donna Kaminski

Fourth Advisor

Dr. Wuwei Shen

Keywords

KDB-tree, BFS reorganization, DFS reorganization, TPIE

Access Setting

Masters Thesis-Open Access

Abstract

Tree structures are developed to organize the data more efficiently by using fewer resources for searching records. This thesis investigates the tree's actual structure on the hard disk to see the influence of different kinds of structures on the tree building time and query execution time. In order to improve efficiency, one multi-file structure and two reorganization structures, BFS and DFS, are examined to achieve this goal. The results indicate that two reorganization structures on KDB-tree structure can significantly improve the query execution time in large data sets and multi-file structure can slightly improve the TPIE lover level building time.

Share

COinS