• Published 1998

Eeciently Executing Information Gathering Plans

@inproceedings{Kambhampati1998EecientlyEI,
  title={Eeciently Executing Information Gathering Plans},
  author={Subbarao Kambhampati},
  year={1998}
}
The most costly aspect of gathering information over the Internet is that of transferring data over the network to answer the user's query. We make two contributions in this paper that alleviate this problem. First, we present an algorithm for reducing the number of information sources in an information gathering (IG) plan by reasoning with localized closed world (LCW) statements. In contrast to previous work on this problem, our algorithm can handle recursive information gathering plans that… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Principles of Database and Knowledge-Base Systems, Volume II

  • Principles of computer science series
  • 1988
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Optimizing Datalog Programs

  • Foundations of Deductive Databases and Logic Programming.
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Duschka . Query Optimization Using Local Completeness

M. Oliver
  • 1997

Duschka and Alon Levy . Recursive plans for information gathering

M. Oliver
  • 1997

Genesereth . Answering Recursive Queries Using Views

Oliver M. Duschka, R. Michael
  • 1997

Duschka . Generating Complete Query Plans Given Approximate Descriptions of Content Providers

M. Oliver
  • 1996