Flexible and scalable query access planning using an AI planner

Planning by rewriting (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 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.