Document Type
Article
Publication Date
1990
DOI
10.1093/comjnl/33.1.79
Publication Title
Computer Journal
Volume
33
Issue
1
Pages
79-89
Abstract
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.
Original Publication Citation
Mukkamala, R., & Bruell, S. C. (1990). Efficient schemes to evaluate transaction performance in distributed database systems. Computer Journal, 33(1), 79-89. doi:10.1093/comjnl/33.1.79
Repository Citation
Mukkamala, R., & Bruell, S. C. (1990). Efficient schemes to evaluate transaction performance in distributed database systems. Computer Journal, 33(1), 79-89. doi:10.1093/comjnl/33.1.79
Included in
Databases and Information Systems Commons, Software Engineering Commons, Theory and Algorithms Commons