摘要
XML文档的查询索引是当前研究的热点。提出一种高效的XML路径查询索引KDXI,首先对XML文档进行编码,然后建立结构索引并对结构索引进行编码。研究了基于KDXI索引结构的半结构连接算法和路径查询处理过程。通过KDXI索引机制,可以有效执行一般的路径查询语句,并避免冗余的结构连接操作。实验证明了KDXI索引机制的优越性。
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 semi-structural 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.
出处
《计算机工程与科学》
CSCD
2005年第11期20-24,共5页
Computer Engineering & Science
