Efficient Alphabetic Text-based Tree Indexing

Abstract

The Indexing data structure is used to store and retrieves data in database. It is frequently being used to speed up access to particular data items. Creating an index is a very important part of databases. Tree is a best option to create indexing for database. Appropriate indexing techniques supports in reducing the space and time complexity of storage and retrieval data. Traditional index sequencing method is used to static database and homogeneous data. To retrieve heterogenous big data, conventional indexing techniques is not useful. For heterogenous big data, optimized decision-making indexing is required. If there is a requirement to create the index for string or character for searching, tree-based indexing is the best option.In this paper, alphabetic text and character-based indexing techniques have proposed for searching purpose. This proposed index technique is very useful for insertion and updating database quickly. The alphabetic text and character-based indexing serve the "Starts with" operations for autocomplete function. Text-based indexing will be more beneficial than hash-based index. Alphabetic text and Character based indexing means the indices for characters are simply the order of alphabets like 'a' -> 0, 'c' -> 2 and so on. The proposed technique can be used to quickly get some important information of one of the fields or combination and proceed with Create, Read, Update and Delete operations. Experimental results show that alphabetic text indexing is better then hash-based indexing for insertion, deletion and updating of database.