Download now Free registration required
This paper defines a number of Query models used to visualize and explore the performance of Relational Algebra queries evaluated in a Dynamic, Distributed and Federated Database with a number of distinct network topologies. Query costs are modelled at a coarse grained level, using a small number of parameters and formulating only the dominant or average behaviours of the queries and topologies considered. This allows them to determine the prevailing factors which impact query performance, and provide a framework to refine and focus on more specific behaviours.
- Format: PDF
- Size: 40.38 KB