Efficient Processing of XML Twig Queries with All Predicates
Efficient Processing of XML Twig Queries with All Predicates
复制标题
DOI：
10.1145/1007568.1007578
复制
发表时间：
2004-06
期刊：
影响因子：
--
通讯作者：
H. Jiang;Hongjun Lu;Wei Wang-
中科院分区：
文献类型：
--
作者：
H. Jiang;Hongjun Lu;Wei Wang-
查找XML数据库中所有出现的小枝模式是有效评估XML查询的核心操作。一些研究已经提出了部分解决方案来处理带有AND、OR或NOT谓词的XML小枝查询。然而，很少有工作已经处理了一个树枝查询与三个谓词全面。本文提出了一种新的路径划分编码方案，并给出了一个强大的XPattern扩展树模式与逻辑谓词。我们还开发了一个整体的树枝连接算法，称为MPTwig，这是专为有效匹配的XML树枝模式与复合和嵌套谓词。我们表明，MPTwig基于路径分区编码方案保证I/O和CPU的最优性。最后，在一个典型数据集上的实验结果表明，该算法的性能显着。
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Some researches have proposed part solutions to process XML twig queries with AND,OR, or NOT predicates. However, very Little work has handled a twig query with three predicates comprehensively. In this paper, we propose a novel path-partitioned encoding scheme, and present a powerful XPattern extended from tree pattern with logic predicates. We also develop a holistic twig join algorithm, called MPTwig, which is designed for efficient matching an XML twig pattern with compound and nested predicates. We show that MPTwig based on path-partitioned encoding scheme guarantee the I/O and CPU optimality. Finally, experimental results on a representative data set indicate that the proposed algorithm performs significantly.