Estimate the transaction states, Database Management System

Suppose an instruction takes 1 nanosecond to execute (on average), a page fault takes 20 microseconds of processor time, and it takes 300 microseconds of disk time to read or write a single page. Suppose that on average, 1/2 of the pages are modified. What is the average number of instructions between page faults that would cause the disk to be busy doing page transfers all the time?


Posted Date: 3/18/2013 6:16:07 AM | Location : United States

Related Discussions:- Estimate the transaction states, Assignment Help, Ask Question on Estimate the transaction states, Get Answer, Expert's Help, Estimate the transaction states Discussions

Write discussion on Estimate the transaction states
Your posts are moderated
Related Questions
Operator Precedence The basic operators used in SQL are * /   - + Operators of the similar priority are evaluated From Left to right Parentheses are used to force priorit

#question.what is mapping constraints and types?.

Which data manipulation command combines the records from one or more tables ? JOIN data manipulation command combines the records from one or more tables.

All edges of a cube are expanding at a rate of 6 centimeters per second. How fast is the surface area changing when each edge is (a) 2 centimeters and (b) 10 centimeters?

What is the difference between serial and sequential files? How searching is applied on both?    Ans: A serial file is one where the records have been stored in the order where

Submit the table creation statements (including constraints) for the Database Model. Submit them all in a single script file. Also submit a document explaining what test data yo

What is Relational DBMS This is our subject of study. A DBMS is relational if the data is organized into relations, that is, tables. In RDBMS, all data are kept in the well-kno

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Increased parallelism : Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have