All Classes and Interfaces
Class
Description
From Melanie Konïg's thesis
Let Q1s and Q2s two set of queries
We say that Q1s covers Q2s (noted Q1s >= Q2s)
if for every query Q2 of Q2
there exist a query Q1 from Q1s such that
Q1 >= Q2 (Q1 subsumes Q2)
For termination reasons, the cover should keep in priority the already explored queries
Creates a query rewriting output where the timeout is indicated
A class to encapsulate the function of rewriting a query against a ruleset
and via a certain algorithm and producing a RewritingResult.
Does nothing
From Melanie Konïg's thesis, algorithm 1 implementation on Graal v1.3
Produces a cover of the set of all rewritings of a query Q with a set of
rules R using piece unifiers
Computes the cover of a set of queries using homomorphism to detect if a query is more general than another
A class for rewriting a collection of FOQuery objects.
From Melanie Konïg's thesis
A rewriting operator rew is a function which takes a conjunctive query Q and a set of rules R
and outputs a set of conjunctive queries noted rew(Q, R).
From Melanie Konïg's thesis Rewriting operator SRA
Query rewriting engine that rewrite query using aggregation by rule of most
general single piece-unifiers
From Melanie Konïg's thesis
Rewriting operator SRA
Query rewriting engine that rewrite query using aggregation by rule of most general single piece-unifiers
Query rewriting engine that rewrite query using aggregation by rule of most general single piece-unifiers
This operator rewrites a query with the given rules assuming the rules are
source to target rules meaning that the vocabulary of the initial query and
the rewritings will be totally disjoint.