Processing logic rules in a SPARQL query engine
A computer-implemented method for processing a logic rule in a graph database. The method includes obtaining a graph database comprising at least one graph, each graph of the database being represented in one or more adjacency matrices (R-Matrix), each adjacency matrix representing a group of tuples of the graph comprising a same predicate, obtaining the logic rule concluding to a head predicate, generating a virtual adjacency matrix comprising one of the one or more adjacency matrices (R-Matrix) and an entailed data matrix (E-Matrix), the virtual adjacency matrix representing the head predicate, the entailed data matrix representing a group of tuples that are computed by applying the logic rule, and receiving a query by the database using the head predicate.
1. A computer-implemented method for processing a logic rule in a graph database, the method comprising:
obtaining a graph database having at least one graph, each graph of the database being represented in one or more adjacency matrices (R-Matrix), each adjacency matrix representing a group of tuples of the graph comprising a same predicate;
obtaining the logic rule concluding to a head predicate;
processing the logic rule on the graph database, thereby obtaining a group of inferred tuples computed by applying the logic rule;
generating a virtual adjacency matrix having one of the one or more adjacency matrices (R-Matrix) and an entailed data matrix (E-Matrix), the virtual adjacency matrix representing the head predicate, wherein the entailed data matrix represents the group of inferred tuples computed by applying the logic rule;
receiving, by the database, a query with the head predicate represented by the generated virtual adjacency matrix; and
answering the received query by matching graph patterns according to the head predicate represented by the generated virtual adjacency matrix.
2. The computer-implemented method of claim 1 , wherein the virtual adjacency matrix further comprises an update processor, the update processor being configured to update the entailed data matrix when the head predicate is modified.
3. The computer-implemented method of claim 1 , wherein the logic rule includes a set of one or more logic rules each being, at most, a first order logic rule.
4. The computer-implemented method of claim 3 , wherein the logic rule is expressed as a linear recursive query.
5. The computer-implemented method of claim 1 , wherein the generation of the entailed data matrix includes a forward chaining technique.
6. The computer-implemented method of claim 1 , wherein the group of tuples of the graph represented by a respective adjacency matrix are non-inferred tuples.
7. The computer-implemented method of claim 1 , wherein the graph database is an RDF graph database, each tuple being:
an RDF triple comprising a subject, a predicate, and an object; or
an RDF quad comprising subject, a predicate, an object, and a graph name.
8. The computer-implemented method of claim 7 , wherein the obtained logic rule is an RDFS rule.
9. The computer-implemented method of claim 7 , wherein the obtained logic rule is a default attribute rule configured to return a default value for an object or a subject of at least one RDF tuple.
10. The computer-implemented method of claim 6 , wherein the receiving a query by the database using the head predicate further comprises receiving a query by an SPARQL query engine.
11. The computer-implemented method of claim 10 , further comprising:
answering the received query by an SPARQL query engine.
12. A non-transitory computer readable storage medium having recorded thereon a computer program comprising instructions for performing a method for processing a logic rule in a graph database, the method comprising:
obtaining a graph database having at least one graph, each graph of the database being represented in one or more adjacency matrices (R-Matrix), each adjacency matrix representing a group of tuples of the graph comprising a same predicate;
obtaining the logic rule concluding to a head predicate;
processing the logic rule on the graph database, thereby obtaining a group of inferred tuples computed by applying the logic rule;
generating a virtual adjacency matrix having one of the one or more adjacency matrices (R-Matrix) and an entailed data matrix (E-Matrix), the virtual adjacency matrix representing the head predicate, wherein the entailed data matrix represents the group of inferred tuples computed by applying the logic rule;
receiving, by the database, a query with the head predicate represented by the generated virtual adjacency matrix; and
answering the received query by matching graph patterns according to the head predicate represented by the generated virtual adjacency matrix.
13. The non-transitory computer readable storage medium of claim 12 , wherein the virtual adjacency matrix further comprises an update processor, the update processor being configured to update the entailed data matrix when the head predicate is modified.
14. The non-transitory computer readable storage medium of claim 12 , wherein the logic rule includes a set of one or more logic rules each being at most a first order logic rule.
15. The non-transitory computer readable storage medium of claim 12 , wherein the logic rule is expressed as a linear recursive query.
16. The non-transitory computer readable storage medium of claim 12 , wherein the generation of the entailed data matrix includes a forward chaining technique.
17. A system comprising:
a processor coupled to a memory, the memory having recorded thereon a computer program comprising instructions that, when executed by the processor, cause the processor to process a logic rule in a graph database by being configured to:
obtain a graph database having at least one graph, each graph of the database being represented in one or more adjacency matrices (R-Matrix), each adjacency matrix representing a group of tuples of the graph comprising a same predicate,
process the logic rule on the graph database, thereby obtaining a group of inferred tuples computed by applying the logic rule,
obtain the logic rule concluding to a head predicate,
generate a virtual adjacency matrix having one of the one or more adjacency matrices (R-Matrix) and an entailed data matrix (E-Matrix), the virtual adjacency matrix representing the head predicate, wherein the entailed data matrix represents the group of inferred tuples computed by applying the logic rule,
receive, by the database, a query with the head predicate represented by the generated virtual adjacency matrix, and
answering the received query by matching graph patterns according to the head predicate represented by the generated virtual adjacency matrix.
18. The system of claim 17 , wherein the virtual adjacency matrix further includes an update processor, the update processor being configured to update the entailed data matrix when the head predicate is modified.
19. The system of claim 17 , wherein the logic rule includes a set of one or more logic rules each being at most a first order logic rule.
20. The system of claim 17 , wherein the logic rule is expressed as a linear recursive query.