An Efficient Index for XML Path Queries

The design of XML query indexes is a hot research topic.This paper proposes an efficient index for the XML query-KDXI.XML files are encoded first,and then structural summaries are constructed and encoded.The semistructural join algorithms and the evaluation process of XML path queries based on KDXI is studied in detail.Through KDXI,general path queries can be evaluated efficiently,and redundant structural joins are avoided.Finally the experiments prove the advantages of KDXI.