###
DOI:
Journal of Software:2009.20(9):2436-2449

图结构XML文档上子图查询的高效处理算法
王宏志,骆吉洲,李建中
(哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001)
Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents
WANG Hong-Zhi,LUO Ji-Zhou,LI Jian-Zhong
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3400   Download 3843
Received:December 13, 2007    Revised:July 09, 2008
> 中文摘要: 研究了图结构XML数据上子图查询处理,给出了一系列高效的处理算法.基于可达编码,首先提出基于哈希的结构连接算法(HGJoin)来处理图结构XML数据上的可达查询.然后,该算法被扩展来处理特殊的二分图查询.基于这些算法和所给出的代价模型,提出了一般DAG子图查询的处理算法和查询优化策略.这些算法经过简单修改即可有效地处理一般的子图查询.理论分析和实验结果表明,算法具有较高的效率.
中文关键词: XML    子图查询  查询处理
Abstract:Many challenges arise in subgraph query processing of graph-structured XML data. This paper studies the subgraph query processing of graph-structured XML data and proposes. A hash-based structural join algorithm, HGJoin to handle reachability queries on graph-structured XML data. Then, the algorithm is extended to process subgraph queries in form of bipartite graphs. Finally, based on these algorithms and cost model presented in this paper, a method to process subgraph queries in form of general DAGs is proposed. It is notable that all the algorithms above can be slightly modified to process subgraph queries in form of general graphs. Analysis and experiments show that all the algorithms have high performance.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60773068, 60773063, 60533110, 60703012 (国家自然科学基金); the National Basic Research Program of China under Grant No.2006CB303000 (国家重点基础研究发展计划(973)) Supported by the National Natural Science Foundation of China under Grant Nos.60773068, 60773063, 60533110, 60703012 (国家自然科学基金); the National Basic Research Program of China under Grant No.2006CB303000 (国家重点基础研究发展计划(973))
Foundation items:
Reference text:

王宏志,骆吉洲,李建中.图结构XML文档上子图查询的高效处理算法.软件学报,2009,20(9):2436-2449

WANG Hong-Zhi,LUO Ji-Zhou,LI Jian-Zhong.Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents.Journal of Software,2009,20(9):2436-2449