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 optimisations strongly depends on the precision of the underlying type inference algorithm. Previous work on type inference for Datalog has focussed on Cartesian abstractions, where the type of each field is computed separately. Such Cartesian type inference is inherently imprecise in the presence of field equalities. We propose a type system where equalities are tracked, and present a type inference algorithm. The algorithm is proved sound. We also prove that it is optimal for Datalog without negation, in the sense that the inferred type is as tight as possible. Extensive experiments with our type-based optimisations, in a commercial implementation of object-oriented Datalog, confirm the benefits of this non-Cartesian type inference algorithm.

  @inproceedings{pods08demoor,
    author="Oege de Moor and Damien Sereni and Pavel Avgustinov and Mathieu Verbaere",
    title="Type Inference for Datalog and its Application to Query Optimisation",
    booktitle="Proceedings of the {ACM} {SIGACT}-{SIGMOD}-{SIGART} Symposium on Principles of Database Systems",
    editor="Maurizio Lenzerini",
    month="June",
    year="2008"}