Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Flexible and Scalable Query Access Planning using an AI Planner \Lambda Jos'e Luis Ambite & Craig A. Knoblock
 

Summary: Flexible and Scalable Query Access Planning using an AI Planner \Lambda
Jos'e Luis Ambite & Craig A. Knoblock
Information Sciences Institute and
Department of Computer Science
University of Southern California
Marina del Rey, CA 90292, USA
fambite, knoblockg@isi.edu
Abstract
In [1], 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 possi­
bly 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 environ­
ments. As a result we obtain an scalable and flexible
query planner for use in an information mediator.
1 Introduction
Planning, the process of generating a network of ac­
tions that achieves a desired goal from an initial state

  

Source: Ambite, José Luis - Information Sciences Institute & Department of Computer Science, University of Southern California

 

Collections: Computer Technologies and Information Sciences