Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems | Zendy

Ravi Mukkamala | Zendy; Steven C. Bruell | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Schemes to Evaluate Transaction Performance in Distributed Database Systems

Author(s) -

Ravi Mukkamala,

Steven C. Bruell

Publication year - 1990

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/33.1.79

Subject(s) - computer science , database transaction , database , distributed database , set (abstract data type) , distributed transaction , node (physics) , transaction processing , database testing , transaction data , data mining , database design , database schema , programming language , structural engineering , engineering

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 evalute 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research