A new novel indexing technique using a bit-tuple tree

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.