Name
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. |
Year | Venue | Keywords |
|---|---|---|
1990 | Proceedings of the PRISMA workshop on Parallel database systems | performance analysis,dynamic query processing scheme,software architecture,query optimization |
Field | DocType | ISBN |
Query optimization,Data mining,Query expansion,Computer science,Sargable,View,Theoretical computer science,Query by Example,Online aggregation,Software architecture,Dynamic query | Conference | 0-387-54132-2 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. L. Kersten | 1 | 0 | 0.68 |
| S. Shair-Ali | 2 | 0 | 0.34 |
| m c van den berg | 3 | 248 | 40.87 |