Type inference for datalog and its application to query optimisation.
Certain variants of object-oriented Datalog can be compiled to Datalog with negation. We seek to apply optimisations akin to virtual method resolution (a well-known technique in compiling Java and other OO languages) to improve efficiency of the resulting Datalog programs. The effectiveness of such...
Main Authors: | Moor, O, Sereni, D, Avgustinov, P, Verbaere, M |
---|---|
Other Authors: | Lenzerini, M |
Format: | Journal article |
Language: | English |
Published: |
ACM
2008
|
Similar Items
-
Adding magic to an optimising datalog compiler.
by: Sereni, D, et al.
Published: (2008) -
Efficient Local Type Inference
by: Bellamy, B, et al.
Published: (2008) -
Group Preferences for Query Answering in Datalog+⁄− Ontologies
by: Lukasiewicz, T, et al.
Published: (2013) -
On the complexity of single−rule datalog queries
by: Gottlob, G, et al.
Published: (2003) -
On the Complexity of Single−Rule Datalog Queries
by: Gottlob, G, et al.
Published: (1999)