Article

Flexible and scalable query planning in distributed and heterogeneous environments

Authors:

José Luis Ambite,

Craig A. KnoblockAuthors Info & Claims

AIPS'98: Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems

Pages 3 - 10

Published: 07 June 1998 Publication History

Abstract

We present the application of the Planning by Rewriting (PbR) framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for efficient high-quality planning that exploits plan rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal. initial plan into a high-quality plan. The resulting planner is scalable, flexible, has anytime behavior, and. applied to query planning, yields a novel combination of traditional query optimization with heterogeneous information source selection. Query planners are the core component of mediator systems, which are becoming increasingly important in a world of interconnected information, and constitute excellent test beds for planning technology.

References

[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 Systems, 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 Computers 31(9):835-850.

[6]

Erol, K.; Nau, D.; and Hendler, J. 1994. UMCP: A sound and complete planning procedure for hierarchical task-network planning. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 249-254.

[7]

Foulser, D. E.; Li, M.; and Yang, Q. 1992. Theory and algorithms for plan merging. Artificial Intelligence 57(2-3):143-182.

[8]

Graefe, G., and DeWitt, D. J. 1987. The EXODUS optimizer generator. In Proceedings of the ACM SIGMOD International Conference on Management of Data.

[9]

Graefe, G.; Cole, R. L.: Davison, D. L.: McKenna, W. J.; and Wolniewicz, R. H. 1994. Extensible query optimization and parallel execution in volcano. In J. C. Freytag, G. Vossen and D. Maier., ed., Query Processing for Advanced Database Applications. San Francisco, California: Morgan Kaufmann. 305-381.

[10]

Graefe, G. 1993. Query evaluation techniques for large databases. ACM Computing Surveys 25(2):73-170.

[11]

Ioannidis, Y., and Kang, Y. C. 1990. Randomized algorithms for optimizing large join queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 312-321.

[12]

Jarke, M., and Koch, J. 1984. Query optimization in database systems. ACM Computing 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/M1T Press.

[14]

Knoblock, C. A. 1995. Planning, executing, sensing, and replanning for information gathering. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence.

[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 Conference on 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 matcher. In Proceedings of the Seventh National Conference on Artificial Intelligence.

[19]

Minton, S. 1992. Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Artificial Intelligence 58(1-3):101-205.

[20]

Papadimitriou, C. H., and Steiglitz, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall.

[21]

Penberthy, J. S., and Weld, D. S. 1992. UCPOP: A sound, complete, partial order planner for ADL. In Third International Conference on Principles of Knowledge Representation and Reasoning. 189-197.

[22]

Pirahesh, H.: Hellerstein, J. M.; and Hasan, W. 1992. Extensible/rule based query rewrite optimization in starburst. In Proceedings of the ACM SIGMOD International Conference on Management of Data.

[23]

Swami, A. N. 1989. Optimization of large join queries: Combining heuristic and combinatorial techniques. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 367-376.

[24]

Tate, A. 1977. Generating project networks. In Proceedings of the Fifth International Joint Conference on Artificial 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, H., eds., Proceedings of 21th International Conference on Very Large Data Bases.

[26]

Zweben, M.; Daun, B.; and Deale, M. 1994. Scheduling and rescheduling with iterative repair. In Intelligent Scheduling. San Mateo. CA: Morgan Kaufman. 241-255.

Cited By

Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2018)LusailProceedings of the VLDB Endowment10.1145/3164135.316414411:4(485-498)Online publication date: 5-Oct-2018
Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2017)LusailProceedings of the VLDB Endowment10.1145/3186728.316414411:4(485-498)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1145/3186728.3164144
R SRaju GMurthy VHamdan HToral-Cruz HAkleylek SMcheick HBoubiche D(2017)Selectivity estimation in web query optimizationProceedings of the Second International Conference on Internet of things, Data and Cloud Computing10.1145/3018896.3152305(1-6)Online publication date: 22-Mar-2017
https://dl.acm.org/doi/10.1145/3018896.3152305
Show More Cited By

Flexible and scalable query planning in distributed and heterogeneous environments
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Flexible and Scalable Query Access Planning using an AI Planner
KDEX '97: Proceedings of the 1997 IEEE Knowledge and Data Engineering Exchange Workshop

We introduced Planning by Rewriting (PBR), a new paradigm for efficient high-quality planning that exploits plan rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a low-...
Continual planning and acting in dynamic multiagent environments

In order to behave intelligently, artificial agents must be able to deliberatively plan their future actions. Unfortunately, realistic agent environments are usually highly dynamic and only partially observable, which makes planning computationally ...
Planning in highly dynamic environments: an anytime approach for planning under time constraints

In this paper, we present a novel and domain-independent planner aimed at working in highly dynamic environments with time constraints. The planner follows the anytime principles: a first solution can be quickly computed and the quality of the final ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

AIPS'98: Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems

July 1998

231 pages

ISBN:1577350529

Editors:
Reid G. Simmons
Carnegie Mellon University
,
Manuela M. Veloso
Carnegie Mellon University
,
Stephen F. Smith
Carnegie Mellon University

Sponsors

Association for the Advancement of Artificial Intelligence

Publisher

AAAI Press

Publication History

Published: 07 June 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2018)LusailProceedings of the VLDB Endowment10.1145/3164135.316414411:4(485-498)Online publication date: 5-Oct-2018
Abdelaziz IMansour EOuzzani MAboulnaga AKalnis P(2017)LusailProceedings of the VLDB Endowment10.1145/3186728.316414411:4(485-498)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1145/3186728.3164144
R SRaju GMurthy VHamdan HToral-Cruz HAkleylek SMcheick HBoubiche D(2017)Selectivity estimation in web query optimizationProceedings of the Second International Conference on Internet of things, Data and Cloud Computing10.1145/3018896.3152305(1-6)Online publication date: 22-Mar-2017
https://dl.acm.org/doi/10.1145/3018896.3152305
Bauer MDengler DPaul GRiecken DBenyon DLieberman H(2000)Instructible information agents for Web miningProceedings of the 5th international conference on Intelligent user interfaces10.1145/325737.325758(21-28)Online publication date: 9-Jan-2000
https://dl.acm.org/doi/10.1145/325737.325758
Ambite JAshish NBarish GKnoblock CMinton SModi PMuslea IPhilpot ATejada S(1998)AriadneACM SIGMOD Record10.1145/276305.27638127:2(561-563)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/276305.276381
Ambite JAshish NBarish GKnoblock CMinton SModi PMuslea IPhilpot ATejada SHaas LDrew P(1998)AriadneProceedings of the 1998 ACM SIGMOD international conference on Management of data10.1145/276304.276381(561-563)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/276304.276381

View Options

View options

Media

Figures

Other

Tables

View Table of Contents