Dynamic parallel query processing:

Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent u...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Berg, C. A. van den (VerfasserIn), Kersten, Martin L. (VerfasserIn), Shair-Ali, S. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1991
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,12
Schlagworte:
Zusammenfassung:Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent use of the system or lack of precision in the derivation of the query plan. In this paper, we propose a dynamic query processing scheme based on subdividing the query into subtasks and scheduling these adequately at run-time. We present the performance results obtained by simulation of a queueing network model of the proposed software architecture. Furthermore, we present the results from a validation of the simulations on the PRISMA 100-node multiprocessor."
Beschreibung:14 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!