计算机应用

• 数据挖掘 • 上一篇    下一篇

一种改进的XML查询重写算法研究

李锐 吴开贵   

  1. 重庆市重庆大学 重庆市重庆大学
  • 收稿日期:2008-09-12 修回日期:2008-10-29 发布日期:2009-03-01 出版日期:2009-03-01
  • 通讯作者: 李锐

Extended algorithm for XML query reformulation

Li Rui Kui-Gui Wu   

  • Received:2008-09-12 Revised:2008-10-29 Online:2009-03-01 Published:2009-03-01
  • Contact: Li Rui

摘要: 查询重写是数据集成的一个关键问题,它是将用户的查询请求自动重写为直接面向数据源的查询请求。最近Michigan大学和IBM的AImaden研究中心提出了一种新的基于约束的XML查询重写算法,但是该算法没有考虑复杂模式匹配重写问题,使得该算法应用受到限制。在原来的算法重写思想基础上,提出了一种改进的XML查询重写算法,扩大原算法的应用范围,并分析了改进算法的正确性和时间复杂度。

关键词: XML, 查询重写, 模式匹配, 数据集成

Abstract: Query reformulation is a key issue of the data integration, and it automatically rewrites the users query request to the data source request directly. Recently the University of Michigan and the IBM AImaden Research Center presented a novel algorithm for constraintbased XML query reformulation, but it did not consider the problem of complex schema matching and limited the algorithm application. Based on the original query reformulation algorithm, an extended algorithm for XML query reformulation was presented, expanding the application scope of the original algorithm. The correctness and time complexity of the extended algorithm were also given.

Key words: XML, query reformulation, schema matching, data integration