Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner

نویسندگان

  • Yujiao Zhou
  • Yavor Nenov
  • Bernardo Cuenca Grau
  • Ian Horrocks
چکیده

We describe a hybrid approach to conjunctive query answering over OWL 2 ontologies that combines a datalog reasoner with a fully-fledged OWL 2 reasoner in order to provide scalable “pay as you go” performance. Our approach delegates the bulk of the computation to the highly scalable datalog engine and resorts to expensive OWL 2 reasoning only as necessary to fully answer the query. We have implemented a prototype system that uses RDFox as a datalog reasoner, and HermiT as an OWL 2 reasoner. Our evaluation over both benchmark and realistic ontologies and datasets suggests the feasibility of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PAGOdA: pay-as-you-go ontology query answering using a datalog reasoner

Answering conjunctive queries over ontology-enriched datasets is a core reasoning task for many applications. Query answering is, however, computationally very expensive, which has led to the development of query answering procedures that sacrifice either expressive power of the ontology language, or the completeness of query answers in order to improve scalability. In this paper, we describe a...

متن کامل

Ontology-based Query Answering with PAGOdA

We describe PAGOdA: a highly optimised ‘pay-as-you-go’ reasoning system that supports conjunctive query (CQ) answering with respect to an arbitrary OWL 2 ontology and an RDF dataset. PAGOdA uses a novel hybrid approach to query answering that combines a datalog reasoner (currently RDFox [10]) with a fullyfledged OWL 2 reasoner (currently HermiT [5]) to provide scalable performance while still g...

متن کامل

PAGOdA: Pay-as-you-go ABox Reasoning

Ontologies are increasingly used to provide structure and enhance access to large datasets. In such applications the ontology can be seen as a TBox, and the dataset as an ABox, with the key reasoning problem being conjunctive query (CQ) answering. Unfortunately, for OWL 2 this problem is known to be of high worst case complexity, even when complexity is measured with respect to the size of the ...

متن کامل

Pay-As-You-Go OWL Query Answering Using a Triple Store

We present an enhanced hybrid approach to OWL query answering that combines an RDF triple-store with an OWL reasoner in order to provide scalable pay-as-you-go performance. The enhancements presented here include an extension to deal with arbitrary OWL ontologies, and optimisations that significantly improve scalability. We have implemented these techniques in a prototype system, a preliminary ...

متن کامل

Efficient Query Answering over Datalog with Existential Quantifiers

This paper faces the problem of answering conjunctive queries over Datalog programs allowing existential quantifiers in rule heads. Such an extension of Datalog is highly expressive, enables easy yet powerful ontology-modelling, but leads to undecidable query answering in general. To overcome undecidability, we first define Shy, a subclass of Datalog with existential quantifiers preserving not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014