© 1990 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems

1 Computer Science Department, Old Dominion University, Norfolk, Virginia 23529, USA, 2 Department of Computer Science, University of Iowa, Iowa City, Iowa 52242, USA
Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop an efficient algorithm to compute these averages.
Received August 1988. revised July 1989.
* Computer Science Department, Old Dominion University, Norfolk, Virginia 23529, USA
Department of Computer Science, University of Iowa, Iowa City, Iowa 52242, USA