ScholarLens Back to search
2016•International Joint Conference on Artificial IntelligenceRequires access

Object-relational queries over CFDI ∀- nc knowledge bases: OBDA for the SQL-literate

Jason St. Jacques, David Toman, Grant Weddell

Open publisher page 6 citations

Abstract

We consider how SQL-like query languages over object-relational schemata can be preserved in the setting of ontology based data access (OBDA), thus leveraging wide familiarity with relational technology. This is enabled by the adoption of the logic CFDInc∀-, a member of the CFD family of description logics (DLs). Of particular note is that this logic can fully simulate DL-LitecoreF, a member of the DL-Lite family commonly used in the OBDA setting. Our main results present efficient algorithms that allow computation of certain answers with respect to CFDInc∀- knowledge bases, facilitating direct access to a pre-existing row-based relational encoding of the data without any need for mappings to triple-based representations.

About this research paper

What this paper is about

We consider how SQL-like query languages over object-relational schemata can be preserved in the setting of ontology based data access (OBDA), thus leveraging wide familiarity with relational technology. This is enabled by the adoption of the logic CFDInc∀-, a member of the CFD family of description logics (DLs). Of particular note is that this logic can fully simulate DL-LitecoreF, a member of the DL-Lite family commonly used in the OBDA setting. Our main results present efficient algorithms that allow computation of certain answers with respect to CFDInc∀- knowledge bases, facilitating direct access to a pre-existing row-based relational encoding of the data without any need for mappings to triple-based representations.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider how SQL-like query languages over object-relational schemata can be preserved in the setting of ontology based data access (OBDA), thus leveraging wide familiarity with relational technology. This is enabled by the adoption of the logic CFDInc∀-, a member of the CFD family of description logics (DLs). Of particular note is that this logic can fully simulate DL-LitecoreF, a member of the DL-Lite family commonly used in the OBDA setting. Our main results present efficient algorithms that allow computation of certain answers with respect to CFDInc∀- knowledge bases, facilitating direct access to a pre-existing row-based relational encoding of the data without any need for mappings to triple-based representations.

Key concepts: SQL, Computer science, Relational database, Conjunctive query, Relational calculus, Object (grammar), Description logic, Ontology

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Object-relational queries over CFDI ∀- nc knowledge bases: OBDA for the SQL-literate — Research Paper | ScholarLens