Research on the Compression Algorithm with Querying without Decompression Based on the Streamline Dynamic Successive Trees

Index compression is an effective way to solve the problem that the index is too huge when mass information is retrieved. Based on the Streamline Dynamic Successive Trees(SDST) index, a compression method with querying on the index without decompression is proposed in this paper.It also presents the compression algorithm,the algorithm of how to retrieve without decompression.The experiments show that the compression efficiency of SDST is much better than that of the IF index and its querying time is much less.