Detecting redundant tuples during query evaluation
Surajit Chaudhuri · 1991
We introduce a new approach to optimization of logic programs.We show that by using simple runtime tests, we can detect redundant tuples during bottom-up evaluation of logic programs.We can exploit such redundancy in many ways, e.g., we can reduce the number of duplicates that are generat ed.We identify data independent properties of the program that can be used for efficient runtime tests.We analyze two such properties of a predicate, emptiness and used-at-most-once.In summary, the paper illustrates how the synergy between the properties of the program and selective runtime information can be used for optimization.