Improving Federated Database Queries Using Declarative Rewrite Rules for Quantified Subqueries

  • Authors:

  • Graham J. L. Kemp;Peter M. D. Gray;Andreas R. Sjöstedt

  • Affiliations:

  • Department of Computing Science, University of Aberdeen, King's College, Aberdeen, Scotland, UK AB24 3UE. gjlk@csd.abdn.ac.uk http://www.csd.abdn.ac.uk/~pfdm;Department of Computing Science, University of Aberdeen, King's College, Aberdeen, Scotland, UK AB24 3UE. pgray@csd.abdn.ac.uk;Department of Computing Science, University of Aberdeen, King's College, Aberdeen, Scotland, UK AB24 3UE

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Transforming queries for efficient execution is particularly important in federated database systems since a more efficient execution plan can require many fewer data requests to be sent to the component databases. Also, it is important to do as much as possible of the selection and processing close to where the data are stored, making best use of facilities provided by the federation's component database management systems. In this paper we address the problem of processing complex queries including quantifiers, which have to be executed against different databases in an expanding heterogeneous federation. This is done by transforming queries within a mediator for global query improvement, and within wrappers to make the best use of the query processing capabilities of external databases. Our approach is based on pattern matching and query rewriting. We introduce a high level language for expressing rewrite rules declaratively, and demonstrate the use and flexibility of such rules in improving query performance for existentially quantified subqueries. Extensions to this language that allow generic rewrite rules to be expressed are also presented. The value of performing final transformations within a wrapper for a given remote database is shown in several examples that use AMOS II—an SQL3-like system.