Date Added: Aug 2012
Indexing is always been an important question in the efficient information retrieval from the databases. One such approach is the Signature Declustering Tree (SD Tree) in Object Oriented Databases (OODB), which has been proved an efficient approach for the insertion and search operations.SD tree is used to represent 1s (set bits) of the signature in the clustered form. This makes the faster retrieval of the information. In the authors' approach they have used the SD tree for storing 0s (unset bits) as well as 1s (set bits) in the clustered form. This makes the search faster for the signatures whose signature weight above 50%.Searching such signatures using the unset bits in the SD tree has improved the search time by 43% approximately.