首页> 外文期刊>Journal of Computer Science & Technology >Updating Recursive XML Views of Relations
【24h】

Updating Recursive XML Views of Relations

机译:更新关系的递归XML视图

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates the view update problem for XML views published from relational data. We consider XML views denned in terms of mappings directed by possibly recursive DTDs compressed into D AGs and stored in relations. We provide new techniques to efficiently support XML view updates specified in terms of XPath expressions with recursion and complex niters. The interaction between XPath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates, and need to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present efficient algorithms to translate XML updates to relational view updates. On the relational side, we propose a mild condition on SPJ views, and show that under this condition the analysis of deletions on relational views becomes PTIME while the insertion analysis is NP-complete. We develop an efficient algorithm to process relational view deletions, and a heuristic algorithm to handle view insertions. Finally, we present an experimental study to verify the effectiveness of our techniques.
机译:本文研究了从关系数据发布的XML视图的视图更新问题。我们认为XML视图是根据由压缩到DAG并存储在关系中的递归DTD定向的映射定义的。我们提供了新技术,可以有效地支持具有递归和复杂特征的XPath表达式所指定的XML视图更新。 XPath递归与XML视图的DAG压缩之间的交互使得对XML视图更新问题的分析颇为有趣。此外,即使需要更新关系视图,许多问题仍然悬而未决,需要探索。针对这些问题,在XML方面,我们修改了副作用的概念,并根据XML视图的语义更新了语义,并提出了将XML更新转换为关系视图更新的有效算法。在关系方面,我们提出了对SPJ视图的温和条件,并表明在这种条件下,对关系视图的删除分析变为PTIME,而插入分析是NP完全的。我们开发了一种有效的算法来处理关系视图删除,并开发了一种启发式算法来处理视图插入。最后,我们提出了一项实验研究,以验证我们技术的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号