Advertisement
Published in:
2007 | OriginalPaper | Chapter
Chase of Recursive Queries
Authors : Nieves R. Brisaboa, Antonio Fariña, Miguel R. Luaces, José R. Paramá
Published in: Perspectives of Systems Informatics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 can state our main contribution as an algorithm that builds a program
P
′ equivalent to a given program
P
, when both are applied over a database
d
satisfying a set of functional dependencies. The input program
P
is a linear recursive datalog program. The new program
P
′ has less different variables and, sometimes, less atoms in rules, thus it is cheaper to evaluate. Using
coral
,
P
′ is empirically shown to be more efficient than the original program.