Question
AIM: To see Read committed runs faster, but results with incorrect answers Serializable results with always correct, but lower throughput. Our company's accounting office is
AIM: To see "Read committed" runs faster, but results with incorrect answers "Serializable" results with always correct, but lower throughput.
Our company's accounting office is trying to pay to its employees their monthly payments. To simplify the problem assume that the database has an ACCOUNTS(accno integer, balance integer) table that holds 101 rows. While the account numbered as 0 has initially 100 lira, and all others numbered as 1,2,...100 has 0 lira. We are sending 1 lira to each account and eventually expecting to see 1 lira at each account. This can be accomplished in different forms, one of which is described below. TX A: --------- e <-- SELECT balance FROM ACCOUNTS WHERE account=i; UPDATE Accounts SET balance=e+1 WHERE account=i; c <-- SELECT balance FROM Accounts WHERE account=0; UPDATE Accounts SET balance=c-1 WHERE account=0; For each employee ( 1i100 ) run the TX-A with isolation level READ COMMITTED. Execute a number of TXs concurrently, ranging from 1 to 5. For the correctness, measure a c-value, "c1-c2/100" where c1 is the balances of account 0 before and after running all transactions, respectively. (c-value =1 means "totally correct") For throughput (Tx/sec,=TPS), first calculate complete execution latency,t, then find TPS as 100/t. Plot correctness c-value and TPS for different experiments (i.e. # of concurrent TX, 1 to 5.) Repeat experiments above for SERIALIZABLE isolation level and plot the corresponding graphs. Compare your results briefly
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started