Query optimization by type lattices in object-oriented logic programs

Abstract

Processing techniques for enhancing execution of programs written in a logic-oriented programming language such as PROLOG are disclosed. The techniques are particularly useful for programs having class predicates and subclass predicates which are definitive of a class/subclass hierarchy, such as the case with PROLOG's application in object-oriented programming systems, expert systems, object-oriented databases, object-oriented deductive databases, knowledge representations, etc. The techniques ensure that searching within the type hierarchy takes precedence over searching of instances of types. Important to accomplishing this function is the pre-assigning of ranks to predicates and clauses within the program to be processed. Query processing on the program is then based upon the pre-assigned predicate and clause rankings. In particular, novel rules are substituted for conventional predicate and clause selection rules of PROLOG interpreters such that predicates and clauses are preferably processed in order of ranking. In addition, certain query processing simplification steps are introduced. The net effect is a technique which eliminates redundant and unnecessary searching at the instance level by taking advantage of information available in the type lattice.