Sciweavers

157 search results - page 2 / 32
» Incremental Evaluation of Datalog Queries
Sort
View
ERSHOV
2006
Springer
13 years 9 months ago
Chase of Recursive Queries
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...
Nieves R. Brisaboa, Antonio Fariña, Miguel ...
ICDT
1995
ACM
105views Database» more  ICDT 1995»
13 years 9 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
PODS
2007
ACM
131views Database» more  PODS 2007»
14 years 5 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen
DLOG
2011
12 years 9 months ago
Goal-oriented Query Rewriting for OWL 2 QL
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
Alexandros Chortaras, Despoina Trivela, Giorgos B....
PPDP
2010
Springer
13 years 3 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu