View-based query containment
View-based query containment
复制标题
DOI：
10.1145/773153.773160
复制
发表时间：
2003-06
期刊：
影响因子：
--
通讯作者：
Diego Calvanese;Giuseppe De Giacomo;M. Lenzerini;Moshe Y. Vardi
中科院分区：
文献类型：
--
作者：
Diego Calvanese;Giuseppe De Giacomo;M. Lenzerini;Moshe Y. Vardi
查询遏制是检查是否在所有数据库中检查查询的答案是第二个查询答案的子集。在几种数据管理任务（例如数据集成，移动计算等）中，仅通过一组视图才能访问感兴趣的数据。在这种情况下，如文献中已经指出的那样，应根据一组观点确定查询的遏制。这种遏制形式是本文的主题。该问题以各种形式出现，具体取决于两个查询中的每个查询是在基本字母表还是视图名称的字母上表示。我们通过从语义的角度讨论所有可能的组合以及通过展示它们的相互关系，对基于视图的查询遏制进行了彻底的分析。特别是，对于连接查询和双向常规路径查询的两个设置，我们为问题的不同变体提供了技术和复杂性界限。最后，我们研究基于视图的查询遏制与基于视图的查询重写之间的关系。
Query containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only accessible through a given set of views. In this case, containment of queries should be determined relative to the set of views, as already noted in the literature. Such a form of containment, which we call view-based query containment, is the subject of this paper. The problem comes in various forms, depending on whether each of the two queries is expressed over the base alphabet or the alphabet of the view names. We present a thorough analysis of view-based query containment, by discussing all possible combinations from a semantic point of view, and by showing their mutual relationships. In particular, for the two settings of conjunctive queries and two-way regular path queries, we provide both techniques and complexity bounds for the different variants of the problem. Finally, we study the relationship between view-based query containment and view-based query rewriting.