# Question: Suppose a system runs three types of transactions Transactions

Suppose a system runs three types of transactions. Transactions of type A run at the rate of 50 per second, transactions of type B run at 100 per second, and transactions of type C run at 200 per second. Suppose the mix of transactions has 25 percent of type A, 25 percent of type B, and 50 percent of type C.

a. What is the average transaction throughput of the system, assuming there is no interference between the transactions.

b. What factors may result in interference between the transactions of different types, leading to the calculated throughput being incorrect? Also be used by an optimistic concurrency control scheme) contribute to the observed throughput being lower than the calculated throughput. Factors such as the limits on the sizes of data-structures and the variance in the time taken by book-keeping functions of the transaction manager may also cause a difference in the values of the observed and calculated throughput.

a. What is the average transaction throughput of the system, assuming there is no interference between the transactions.

b. What factors may result in interference between the transactions of different types, leading to the calculated throughput being incorrect? Also be used by an optimistic concurrency control scheme) contribute to the observed throughput being lower than the calculated throughput. Factors such as the limits on the sizes of data-structures and the variance in the time taken by book-keeping functions of the transaction manager may also cause a difference in the values of the observed and calculated throughput.

**View Solution:**## Answer to relevant Questions

Suppose the price of memory falls by half, and the speed of disk access (number of accesses per second) doubles, while all other factors remain the same. What would be the effect of this change on the 5 minute and 1 minute ...For each of the SQL aggregate functions sum, count, min and max, show how to compute the aggregate value on a multiset S1 ∪ S2, given the aggregate values on multisets S1 and S2. Based on the above, give expressions to ...Consider the sales relation from Section 22.2. Write an SQL query to compute the cube operation on the relation, giving the relation in as shown below. Do not use the with cubeconstruct.Suppose you want to find documents that contain at least k of a given set of n keywords. Suppose also you have a keyword index that gives you a (sorted) list of identifiers of documents that contain a specified keyword. Give ...Describe how the ideas behind the RAID organization (Section 11.3) can be used in a broadcast-data environment, where there may occasionally be noise that prevents reception of part of the data being transmitted.Post your question