XML Retrieval More Efficient Using Compression Technique
Tanakorn Wichaiwong, Chuleerat Jaruskulchai · 2011
Abstract — In this paper, we report experimental results of our approach for retrieval large-scale XML collection, to improve both efficiency and effectiveness of XML Retrieval. We propose new XML compression algorithm that allows supporting Absolute Document XPath Indexing and Score Sharing Algorithm by a Top-Down Scheme approach. It has been discovered that these steps reduce the size of the data down by 91.87 % compare to GPX, and reduce the length of Score Sharing processing time down to 44.18 % when compared to before the compression. In terms of processing time, our system required an average of one second per topic on INEX-IEEE and an average of ten seconds per topic on INEX-Wiki better than GPX system. In addition, we explain the comprehensive description of our XML retrieval system, with performance experiments on large-scale corpora on INEX collections.