This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1997 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX '97)
Flexible and Scalable Query Access Planning using an AI Planner
Newport Beach, CA
November 04-November 04
ISBN: 0-8186-8230-2
Jose Luis Ambite, University of Southern California
Craig A. Knoblock, University of Southern California
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-cost plan. In this paper we show in detail the application of the general framework to query planning in distributed environments. As a result we obtain an scalable and flexible query planner for use in an information mediator.
Index Terms:
Planning, Query optimization, Rewriting
Citation:
Jose Luis Ambite, Craig A. Knoblock, "Flexible and Scalable Query Access Planning using an AI Planner," kdex, pp.132, 1997 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.