Reformulation of XML Queries and Constraints
Reformulation of XML Queries and Constraints
复制标题
DOI：
10.1007/3-540-36285-1_15
复制
发表时间：
2003-01
期刊：
影响因子：
--
通讯作者：
Alin Deutsch;V. Tannen
中科院分区：
文献类型：
--
作者：
Alin Deutsch;V. Tannen
我们在一般设置中陈述并解决了 XML 发布的查询重构问题，该设置允许专有数据的混合（XML 和关系）存储并利用冗余（物化视图、索引和缓存）来增强性能。已发布模式和专有模式之间的对应关系由两个方向的视图指定，并且相同的算法执行用视图重写、用视图组合或两者的组合效果，统一了全局作为视图和本地作为视图的数据集成方法。我们证明了一个完备性定理，该定理保证在某些条件下，我们的算法将找到最小重构（如果存在）。此外，我们确定了该算法达到最佳复杂度界限的条件。我们通过利用查询重构问题的简化来解决约束的重构问题。
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (materialized views, indexes and caches) to enhance performance. The correspondence between published and proprietary schemas is specified by views in both directions, and the same algorithm performs rewriting-with-views, composition-with-views, or the combined effect of both, unifying the Global-As-View and Local-As-View approaches to data integration. We prove a completeness theorem which guarantees that under certain conditions, our algorithm will find a minimal reformulation if one exists. Moreover, we identify conditions when this algorithm achieves optimal complexity bounds. We solve the reformulation problem for constraints by exploiting a reduction to the problem of query reformulation.