XML Retrieval More Efficient Using ADXPI Indexing Scheme

XML Information Retrieval is approach to identify the appropriate answer granularity and controlling to elements overlap. Recently, the demand for integrating Full Text Search and relational search has increased dramatically. The RDBMS implementation is generally much worse in the performance than the IR engine implementation. Especially, when a query is processed in the RDBMS, the number of join operation increases in proportion to the number of relationships in the query. In order to solve these problems, we propose in this paper a novel approach to extend the inverted index for support query processing, namely Absolute Document XPath Indexing that allows supporting and reducing the length of time on Score Sharing scheme. 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.