๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of single-rule datalog queries

โœ Scribed by Georg Gottlob; Christos Papadimitriou

Book ID
118590081
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
197 KB
Volume
183
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Expected Size of Recursive Datalo
On the Expected Size of Recursive Datalog Queries
โœ S. Seshadri; J.F. Naughton ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 998 KB

We present asymptotically exact expressions for the expected sizes of relations defined by three well-studied Datalog recursions, namely the "transitive closure," "same generation," and "canonical factorable recursion." We consider the size of the fixpoints of the recursively defined relations in th

On the Complexity of Database Queries
On the Complexity of Database Queries
โœ Christos H. Papadimitriou; Mihalis Yannakakis ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory. We show that, if the query size (or the number of variables in the query) is considered as a parameter, then the relational calculus and its fragments (conjunctive queri

On the computational complexity of query
On the computational complexity of querying bounds on differences constraints
โœ Vittorio Brusoni; Luca Console; Paolo Terenziani ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import