Indexing Object Database using HC-Tree
Uma Perumal1, Maha Ibrahim Shaabi2
1Uma Perumal*, Department of Computer Science, Jazan University, Kingdom of Saudi Arabia.
2Maha Ibrahim Shaabi, Department of Computer Science, Jazan University, Kingdom of Saudi Arabia.
Manuscript received on January 26, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 3205-3208 | Volume-9 Issue-3, February 2020. | Retrieval Number: C6088029320/2020©BEIESP | DOI: 10.35940/ijeat.C6088.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: One of the recent applications of object technology is in the area of databases. One of the stumbling blocks in the commercial development and deployment of object databases is the lack of an efficient indexing technique. The properties of object databases make the task of development of an indexing technique all the more difficult. This paper discusses the development of an indexing technique for object databases. A new indexing technique based on a new structure, HC-Tree has been proposed. Performance analysis has been conducted, and experimental and analytical results indicate that the HC-Tree is an efficient indexing structure for object databases. The performance of the HC-Tree has also been compared with that of the other popular existing techniques – CH-Tree, H-Tree and hcC-Tree.
Keywords: Object Databases, Indexing, Query Retrieval, Data Structure.