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.

Additional Metadata
Keywords Database machines, Dynamic query processing, Performance analysis
Persistent URL dx.doi.org/10.1007/3-540-54132-2_61
Conference PDS Workshop
Citation
Kersten, M.L, Shair-Ali, S, & van den Berg, C.A. (1990). Performance analysis of a dynamic query processing scheme. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 259–274). doi:10.1007/3-540-54132-2_61