Abstract

Traditional query optimizers produce a fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time. In this paper, we propose a dynamic query processing scheme and we present the performance results obtained by simulation of a queueing network model of the proposed software architecture.

Key Words & Phrases

database machines dynamic query processing performance analysis

1985 Mathematics Subject Classification

69C40 69C24 69H24 69H26 69H33

1990 CR Categories

C.4 C.2.4 H.2.4 H.2.6 H.3.3 I.6.3

The work reported in this paper was conducted as part of the PRISMA project, a joint effort with Philips Research Eindhoven, partially supported by the Dutch “Stimuleringsprojectteam Informaticaonderzoek (SPIN)”.