Abstract: ABSRACT: In this paper, we propose RIST, a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, we show that querying XML data is equivalent to finding subsequence matches. RIST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, RIST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either content or structure. Our experiments show that RIST is effective and efficient in supporting structural queries.

摘要： 摘要：本文提出了一种用于搜索XML文档的新的索引方法即RIST。通过采用代码化的结构序列（SES）来表示XML文档和XML查询，我们得出查询XML数据等同于查找子序列匹配。RIST采用树结构作为查询的基本单元，从而避免了代价高昂的连接操作。另外，RIST还在XML文档的内容和结构上提供了一个统一的索引，所以它的一个很明显的优势就是克服了仅仅根据内容或结构建立索引的弊端。实验表明RIST在支持结构查询上是一种高效的方法。