论文标题
回答对DL-Lite本体论的计数查询
Answering Counting Queries over DL-Lite Ontologies
论文作者
论文摘要
本体介导的查询答案（OMQA）是一种有前途的数据访问和集成方法，在知识表示和数据库社区中已经积极研究了十多年。 OMQA上的绝大多数工作都集中在结合性查询上，而具有计数或其他形式的聚合的更具表现力的查询仍然很大程度上没有排列。在本文中，我们介绍了计算查询，将其与以前的建议联系起来的一般形式，并研究了在存在DL-Lite本体论的情况下回答此类查询的复杂性。从现有的工作中，查询答案是棘手的，而且通常具有很高的复杂性，我们考虑了一些实际相关的限制，为此我们建立了改善的复杂性界限。
Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communities for more than a decade. The vast majority of work on OMQA focuses on conjunctive queries, whereas more expressive queries that feature counting or other forms of aggregation remain largely unex-plored. In this paper, we introduce a general form of counting query, relate it to previous proposals, and study the complexity of answering such queries in the presence of DL-Lite ontologies. As it follows from existing work that query answering is intractable and often of high complexity, we consider some practically relevant restrictions, for which we establish improved complexity bounds.
