The Problem

• Plans for gathering information on the internet can be modeled as datalog programs whose EDB predicates correspond to calls to internet sources.

• Optimizing the execution of these programs involves optimizing the ordering of source calls

  • In the special case where the IG plans are conjunctive queries, this problem reduces to join ordering problem

Previous slide

Next slide

Back to first slide

View graphic version