An Efficient XML Index Structure with Bottom-Up Query Processing
An Efficient XML Index Structure with Bottom-Up Query Processing
复制标题
DOI：
10.1007/978-3-540-72588-6_131
复制
发表时间：
2007-05
期刊：
影响因子：
--
通讯作者：
Dongmin Seo;Jaesoo Yoo;Ki-Hyung Cho
中科院分区：
文献类型：
--
作者：
Dongmin Seo;Jaesoo Yoo;Ki-Hyung Cho
随着XML在数据交换中的重要性日益增长，人们已经做了大量的研究来证明灵活的查询机制，以从结构化XML文档中提取数据。XML数据的半结构化特性和对查询灵活性的要求对数据库索引方法提出了独特的挑战。近年来，人们提出了使用后缀树和B+树的ViST来减少文档的搜索时间。然而，由于ViST的编号方案没有优化，因此在处理结构连接查询时会导致大量不必要的计算和I/O。在本文中，我们提出了一种新的索引结构，以解决问题的ViST。我们的索引结构提供了自底向上的查询处理方法，有效地处理结构化查询。实验结果表明，该索引结构在处理带有各种通配符（“*”和“//”）的单路径和分支查询时是有效的。
With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and B+Tree was proposed to reduce the search time of the documents. However, it can cause a lot of unnecessary computation and I/O when processing structural join queries because the numbering scheme of ViST is not optimized. In this paper, we propose a novel index structure to solve the problems of ViST. Our index structure provides the bottom-up query processing method to efficiently process structural queries. Our experiments show that the proposed index structure is efficient in processing both single-path and branching queries with various wild-cards (‘*’ and ‘//’).