Optimizing Recursive Information Gathering Plans
PPT Slide
Optimization challenges in EMERAC
Source Access Limitations
Representing Source Access Limitations
Properties of optimal information gathering plans
Building Source Complete Plans
Problems with Plans derived from source inversion rules
Minimizing information gathering plans
Uniform Equivalence
Greedily Minimizing Information Gathering Plans
Relating binding patterns
Issues in ordering source calls
Our Approach: Assumptions
Our Approach: Overview
The HTBP Table
The Algorithm
Example
Experiments
LCW vs. Naïve [Artificial Sources]
LCW vs. Naïve [DBLP Sources]
Graceful degradation
Current directions
Email: rao@asu.edu
Home Page: http://rakaposhi.eas.asu.edu
Download presentation source