首页> 外文OA文献 >Updating XML Views Published over Relational Databases: Towards the Existence of a Correct Update Mapping
【2h】

Updating XML Views Published over Relational Databases: Towards the Existence of a Correct Update Mapping

机译:更新通过关系数据库发布的XmL视图:正确更新映射的存在

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

XML data management using relational database systems has been intensively studied in the last few years. However, in order for such systems to be viable, they must support not only queries, but also updates over virtual XML views that wrap the relational data. While view updating is a long-standing difficult issue in the relational context, the flexible XML data model and nested XML query language both pose additional challenges for view updating. This paper addresses the question, if for a given update over an XML view, a correct relational update translation exists. First, we propose a clean extended-source theory as criteria for determining whether a given translation mapping is correct. To determine the existence of such a correct mapping, we classify a view update as either un- translatable, conditionally or unconditionally translatable under a given update translation policy. This classification depends on several features of the XML view and the update: (a) granularity of the update at the view side, (b) properties of the view construction, and (c) types of duplication appearing in the view. These features are represented in the Annotated Schema Graph. This is further utilized by our Schema-driven Translatability Reasoning algorithm (STAR) to classify a given update into one of the three above update categories. The correctness of the algorithm is proven using our clean extended-source theory. This technique represents a practical approach that can be applied by any existing view update system in industry and academia for analyzing the translatability of a given update statement before translation of it is attempted. To illustrate the working algorithm, we provide a concrete case study on the translatability of XML view updates.
机译:在最近几年中,已经对使用关系数据库系统的XML数据管理进行了深入研究。但是,为了使这样的系统可行,它们不仅必须支持查询,而且还必须在包装关系数据的虚拟XML视图上进行更新。尽管视图更新是关系上下文中一个长期存在的难题,但是灵活的XML数据模型和嵌套的XML查询语言都给视图更新带来了其他挑战。本文解决了以下问题:如果对于XML视图上的给定更新,是否存在正确的关系更新转换。首先,我们提出一种干净的扩展源理论作为确定给定翻译映射是否正确的标准。为了确定这种正确映射的存在,我们将视图更新在给定更新转换策略下分类为不可翻译,有条件或无条件可翻译。这种分类取决于XML视图和更新的几个功能:(a)视图侧更新的粒度,(b)视图构造的属性,以及(c)出现在视图中的重复类型。这些功能在带注释的架构图中表示。我们的模式驱动可翻译性推理算法(STAR)进一步利用了这一点,将给定的更新分类为上述三个更新类别之一。使用我们干净的扩展源理论证明了该算法的正确性。该技术代表了一种实用的方法,可以由工业界和学术界的任何现有视图更新系统应用,以在尝试翻译给定更新语句之前分析其可翻译性。为了说明该工作算法,我们提供了有关XML视图更新的可翻译性的具体案例研究。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号