Containment of conjunctive object meta-queries
Containment of conjunctive object meta-queries
复制标题
连接对象元查询的包含
DOI：
10.5555/1182635.1164208
复制
发表时间：
2006
影响因子：
1.4
通讯作者：
M. Kifer
中科院分区：
文献类型：
--
作者：
A. Calí;M. Kifer
我们考虑从 F-logic 派生的对象数据模型上的查询包含问题。 F-logic 作为构建本体和在语义 Web 上进行推理的手段，在商业界、学术界以及各种标准化工作中引起了相当大的兴趣。解决 F 逻辑查询的包含问题可以帮助查询优化以及信息集成系统中的分类问题。 F 逻辑查询的一个重要属性使其与数据库查询区分开来，即它们可以以简单且有用的方式混合数据级和元级。这意味着此类查询不仅可以引用数据，还可以引用模式信息。据我们所知，文献中尚未考虑此类查询的包含问题。我们表明，即使对于元信息和数据的查询，这个问题对于非递归联合查询也是可判定的。我们还提供相关的复杂性结果。
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within various standardization efforts as a means for building ontologies and for reasoning on the Semantic Web. Solution to the containment problem for F-logic queries can help with query optimization as well as the classification problem in information integration systems. An important property of F-logic queries, which sets them apart from database queries, is that they can mix the data-level and the meta-level in simple and useful ways. This means that such queries may refer not only to data but also schema information. To the best of our knowledge, the containment problem for such queries has not been considered in the literature. We show that, even for queries over meta-information together with data, this problem is decidable for non-recursive conjunctive queries. We also provide relevant complexity results.