2016
DOI: 10.1007/978-3-319-45276-0_11
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Approach to Query Answering Under Expressive Datalog $$^\pm $$

Abstract: Datalog ± is a family of ontology languages that combine good computational properties with high expressive power. Datalog ± languages are provably able to capture many relevant Semantic Web languages. In this paper we consider the class of weakly-sticky (WS) Datalog ± programs, which allow for certain useful forms of joins in rule bodies as well as extending the well-known class of weakly-acyclic TGDs. So far, only nondeterministic algorithms were known for answering queries on WS Datalog ± programs. We prese… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2
1
1

Relationship

3
1

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 13 publications
(33 reference statements)
0
8
0
Order By: Relevance
“…It is also independent of any procedural mechanism for quality data extraction and data cleaning, but computational methods can be extracted from (or be based on) the speci cations e implementation of the alityQA algorithm and experiments to evaluate its performance correspond to ongoing work. e algorithm and its optimization is based on our work on QA under WS programs [74,75].…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…It is also independent of any procedural mechanism for quality data extraction and data cleaning, but computational methods can be extracted from (or be based on) the speci cations e implementation of the alityQA algorithm and experiments to evaluate its performance correspond to ongoing work. e algorithm and its optimization is based on our work on QA under WS programs [74,75].…”
Section: Discussionmentioning
confidence: 99%
“…Unlike sticky programs, for complexity-theoretic reasons, WS programs do not allow FO rewritability for CQA. However, a hybrid algorithm is proposed in [75]. It is based on partial grounding of the tgds using the extensional data, obtaining a sticky program, and a subsequent rewriting of the query.…”
Section: Omd Ontologies As Weakly-sticky Datalog ± Programsmentioning
confidence: 99%
See 1 more Smart Citation
“…Actually, about (A), we provide for the class SCh(S ∃ ) a polynomial-time, chase-based, bottom-up QA algorithm, which can be applied to JWS (and all its semantic and syntactic subclasses) in particular. This is a general situation: The polynomial-time QA algorithms for the classes Sticky [10], WS [10,22], and JWS (this work) rely basically on the properties of the semantic class rather than on the specific syntactic restrictions. Hence our interest is in investigating the particular semantics classes, and semantic classes in general, as defined by selection functions.…”
Section: S ⊥mentioning
confidence: 99%
“…Actually, they belong to the class of weakly-sticky Datalog ± programs [4], for which conjunctive query answering (CQA) can be done in polynomial time in data. Algorithms for CQA have been proposed [8,9], so as optimizations thereof [8] with magic-sets techniques [1].…”
mentioning
confidence: 99%