A new novel indexing technique using a bit-tuple tree

Author

Umesh, H. ; Agarwal, Mohit ; Rastogi, Parkhi ; Agrawal, Sneha ; Mittal, Somya ; Jain, Sourabh ; Madhurima, V.L.R. ; Kushwaha, D.S.

Author_Institution

Comput. Sci. & Eng. Dept., MNNIT, Allahabad, India

fYear

2010

fDate

12-13 March 2010

Firstpage

224

Lastpage

226

Abstract

The rapid growth of information systems has resulted in new requirements of data indexing and retrieval. Several indexing techniques have been developed, with inverted lists, B+ trees and hashing being most extensively used. We propose a new hash indexing technique for faster search time by using a hash table and resolving collision using a bit-tuple tree. The technique gives a constant order search for a data set of known maximum number of elements.

Keywords

file organisation; indexing; information retrieval; information systems; trees (mathematics); B+ trees; bit-tuple tree; data indexing; data retrieval; hash indexing; hash table; hashing; indexing technique; information systems; Computer science; Data engineering; Data structures; Indexing; Information filtering; Information retrieval; Information systems; Telecommunication computing; Tree data structures; B and B+ tree; Hash functions (HF); Hashing; Information retrieval;

fLanguage

English

Publisher

ieee

Conference_Titel

Recent Trends in Information, Telecommunication and Computing (ITC), 2010 International Conference on

Conference_Location

Kochi, Kerala

Print_ISBN

978-1-4244-5956-8

Type

conf

DOI

10.1109/ITC.2010.62

Filename

5460540