Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments

Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998

Volumn , Issue , 1998, Pages 3-10

  Ambite, Jose Luis ^a   Knoblock, Craig A ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

DISTRIBUTED ENVIRONMENTS; HETEROGENEOUS ENVIRONMENTS; HETEROGENEOUS INFORMATION SOURCES; HIGH QUALITY; INFORMATION SOURCE SELECTIONS; LOCAL SEARCH TECHNIQUES; QUALITY PLANNING; QUALITY PLANS; QUERIES OPTIMIZATION; REWRITING RULES;

SEARCH ENGINES;

EID: 0347864341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Ambite, J. L., and Knoblock, C. A. 1997. Planning by rewriting: Efficiently generating high-quality plans. In Proceedings of the Fourteenth National Conference on Artificial Intelligence.
2. Ambite, J. L.; Knoblock, C. A.; Muslea, I.; and Philpot, A. 1998. Compiling source descriptions for efficient and flexible information integration. Submitted.
3. Arens, Y.; Knoblock, C. A.; and Shen, W.-M. 1996. Query reformulation for dynamic information integration. Journal of Intelligent Information Syslems, Special Issue on Intelligent Information Integration 6(2/3):99 130.
4. Ashish, N.; Knoblock, C. A.: and Levy, A. 1997. Information gathering plans with sensing actions. In Proceedings of the Fourth European Conference on Planning.
5. Chu, W. W., and Hurley, P. 1982. Optimal query processing for distributed database systems. IEEE Transactions on Uomputers 31(9):835-850.
6. Erol, K.; Nau, D.; and llendler, J. 1994. UMCP A sound and COnlplete planning procedure for hierarchical task-network planning. In Proceedings of the SecondInternational Conferrnce on Artificial Intelligence Planning Systems, 249-254.
7. Foulser, D. F.; Li, M.; and Yang, Q. 1992. Theory and algorithms for plan merging. Artificial Intelligence 57(2-3):143 189.
8. Graefe, G., and DeWitt, D.J. 1987. The EXO-I)US optimizer generator. In Proceedings of the AC SIGMODInternational Conference on Management of Data.
9. Graefe, G.; C.ole, R. L.: Davison, D. L.: McKenna W.J.; and Wohfiewiez,R. I1. 1994. Extensible query optimization and parallel execution in volcano. In .I.C. Freytag, G. Vossen and D. Mater., ed., Query Processing for’ AdvancedDatabaseApplications. San Francisco, C.alifornia: MorganKaufmann.305-381.
10. Graefe, G. 1993. Query evaluation techniques for large databases. ACMComputing Sum;cgs 25(2):73-170.
11. Ioannidis, Y., and Kang. Y. C.. 1990. Randomizedalgorithms for optimizing large join queries. In l’roctedings of the ACMSIGMODInternational Conference on Management of Data, 312.321.
12. Jarke, M., and Koch, J. 1984. Query optimization in database systems. ACMComputing Surveys 16(2):111-152.
13. Knoblock, C. A., and Ambite, J. L. 1997. Agents for information gathering. In Bradshaw,J.. ed.. Software Agents. Menlo Park, CA: AAAI/MITPress.
14. . Fourteenth International Joint Conferenc on Artificial Intelhgence.
15. Knoblock, C. A. 1996. Building a planner for information gathering: A report from the trenches. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems.
16. Kwok, C. T., and Weld, D. S. 1996. Planning to gather information. In Proceedings of the Thirteenth National Conferenceon Artificial Intelligence.
17. Levy, A. Y.; Rajaraman, A.; and Ordille, J. J. 1996. Query-answering algorithms for information agents. In Proceedings of the Thirteenth National Conference on Artificial Intelligence.
18. MacGregor, R. 1988. A deductive pattern marcher. In Proceedings of the Seventh National Conference on Artificial Intelligence.
19. Minton, S. 1992. Minimizingconflicts: Aheuristic repair methodfor constraint-satisfaction and scheduling problems. Artificial [ntelh.qence 58(1-3):161 205.
20. Papadimitriou, C. H.. and Steiglitz. K. 1982. Com binatorial Optimization: Algorithms and Complexity. EnglewoodCliffs, NJ: Prentice Hall.
21. Penberthy, J. S., and Weld, D.S. 1992. t’CPOP: A sound, complete, partial order planner for ADL In Third International Conferenc¢ on Principles of KnowledgeRepresentation and Reasoning. 189 197.
22. Pirahesh, 11.: lleilerstein, J. M.; and Hasan. W.1992. Extensible/rule based query rewrite optimization in starburst. In Proceedings of the ACMSIGMODInternational Confernce on Management of Data.
23. Swami,A. N. 1989. Optimization of large join queries: C.ombiningheuristic and combinatorial techniques. In Proceedings of the A CMSIGMODInternational Con-terence on Managementof Data, 367-376.
24. Fate, A. 1977. Generating project networks. In Proceedings of the Fifth International Joint Conference onArtificial Intelligence, 888-893.
25. Yan, W. P., and Larson, P.-A. 1995. Eager aggregation and lazy aggregation. In McLeod,D.: Sacks-Davis, R.; and Schek, 11., eds.. Proceedings of 21th International Conference on Very Large Data Bases.
26. Zweben, M.; Daun, B.; and l)eale, M. 199,1. Scheduling and rescheduling with iterative repair. In Intelligent Scheduling. San Marco, CA: Morgan Kaufman. 241-255.