TB±tree: Index structure for Information Retrieval Systems

Information Retrieval Systems (IR) is using different indexing techniques to retrieve information such as, Inverted files, and Signature files. However, Signature files are suitable for small IR systems due to its slow response, while inverted file have better response time but its space overhead is high. Moreover, inverted files use B±trees for single-word queries. In this paper, a new indexing structure called TB±tree to be used in the design of inverted files for large information retrieval systems. The TB±tree is a variant of the B±tree that supports single key-word queries and phrase queries efficiently. In TB±tree algorithms which represent each key-word stored in the index by a numeric value, and this numeric value can be used as encryption and inforce security. The numeric value for each keyword is stored in binary format, which may reduce the size of the index file by 19%. The records in TB±tree may be of variable length.