Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 9.4, Problem 3QE
Program Plan Intro
Interweaving of transactions:
If two or more transactions are processed from the same account in small interval of time, it is known as interweaving of transactions.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
We have the following transactions with associated schedulesT1: R(A) R(B) W(A)T2: R(A) R(B) W(A) W(B)a) Give the schedule of transactions T1 and T2 that leads to a WR conflict.b) Give the schedule of transactions T1 and T2 that lead to RW conflict.c) Give the schedule of transactions T1 and T2 that leads to a WW conflict.d) For each of the given schedules, show how a strict 2FZ would prevent this.
Consider the following two transactions:
T1 = R(A). W(A), R(B), R(C)
T2 - W(C). R(B), R(A). W(B)
Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions:
T1 - X(A), R(A), W(A), S(B), R(B), S(C), U(A), R(C), U(B), S(C)
T2 - X(C), W(C), X(B), S(A), U(C), R(B), R(A), U(A), W(B), U(B)
The above schedule follows 2 PL so conflict serializability is guaranteed.
O True
O False
Consider the following two transactions:
T1-R(B), W(B), R(C), R(A)
T2-R(B). W(B)
Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions:
T1= X(B), R(B), W(B), S(C), R(C), S(A), U(B), R(A), U(C), U(A)
T2-X(B), R(B), W(B), U(B)
Cascading rollback is not possible for the above schedule.
True
False
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- We are given the following transaction schedule, where A,B,C are the addresses of the records in the database and T1 and T2 are the transactions. T1 R(A) W(A) R(B) W(B) R(C) W(C) COMMIT T2 R(C) R(B) W(B) a) Show that using strict two-phase locking leads to complications b) For example a, draw a »waits-for<< graph c) Resolve the problems in example a, using the "Wound-Wait" protocol R(A) W(A) W(C) COMMITarrow_forwardComputer Science A blockchain could be considered as a state machine. Suppose a hospial with 100,000 patients, 500 physicians, 1000 nurses, and 100 adminsitrative staff is using a blockchain to keep track of its activities. Each patient has a patient ID. Each of the employees (physicians, nurses, and admins) have an employee ID. For simplicity let us assume that there are only five types of transactions: (i) New patient admitted and assignd an ID by an admin (ii) A patient is discharged by an admin (iii) A nurse takes a triage of the patient (temperature, blood pressure, etc.) and records the information(iv) A physician makes a diagnosis and prescribes medications (v) Patient is billed by an admin. Answer the following questions. What could be the state of the hospital? What would a transaction of type (iv) look like? (Hint: Show the type and its parameters) If a patient with ID A67567 has been discharged (type ii), show how this transaction results in a transition to a new state?…arrow_forwarda. Which itemsets (of any length) are frequent if you know that {ace} and {ad} are the only maximal frequent itemsets? b. If all transactions that contain {bcd} also contain {def}, which of the following itemsets {bcd}, {def}, {bcde}, {bcdf}, {bcdef} are not closed?arrow_forward
- Suppose half of all the transactions in a clothes shop purchase jeans, and onethird of all transactions in the shop purchase T-shirts. Suppose also that half of the transactions that purchase jeans also purchase T-shirts. Write down all the (nontrivial) association rules you can deduce from the above information, giving support and confidence of each rule.arrow_forwardIn the 2PL algorithm we considered, a transaction can't start until it has acquired all the locks it needs (we call this, Conservative 2PL). There is a different scheme possible, where a transaction does NOT need to wait for all its locks - it can start its transactions before all the locks have been acquired. What would be good about such a scheme, and, what would be bad? Do feel free to illustrate with a diagram.arrow_forwardDamon Davis was creating the Drano Plumbing Company's spreadsheet. He determined that the net income would be $50,000. When he tallied the columns on the Balance Sheet, the totals were as follows: debit, $400,000; and credit, $300,000. What was the most likely reason for this discrepancy? If this was not the case, how should he proceed to determine the source of the error?arrow_forward
- In a dimensional model, how does the duration of a transaction normally appear?arrow_forwardConsider the following 2 transactions: T1: R(A); R(B); B=A+B; W(B) T2: R(B); R(A); A=A+B; W(A) Change T1 and T2 by adding X lock and S lock to satisfy strict two-phase locking. (Please format your answer in the following way: for a simple read on A with S lock, you can write S(A); R(A); unlock(A)) Will the execution of your changed T1 and T2 cause deadlock? If so, please provide a schedule example. You can write the schedule in the table format with columns T1 and T2.arrow_forwardAn analyst investigating University Student course registration system has found registration department applies the following rules: Student affairs department checks all applications for course registrations received by the campus. Student affairs first checks the pre requisite of the selected courses for each application and adds that credit to the student's fee balance. If the credit hour exceeds the limit defined for that program, student's application is rejected and is intimated to reselect the courses as per defined limit of credit hours. All such students who have selected the courses according to university policy their fee voucher is generated and that the fee voucher has been passed to the accounts manager who will contact them in the next three days. After the payment of fee, confirmation is to be sent by accounts manager through SMS. In case fee voucher is generated and is not collected by the student reminder message is sent reminding the student of the payment of fees.…arrow_forward
- Consider the transaction database represented by the matrix D: I1 I2 I3 I4 I5 I6 T1 1 1 T2 T3 1 1 T4 1 1 1 1 1 T5 1 1 Determine the confidence of the association rule A = B, where A = {I1} and B = {I2} Write your answer as a percentage value, i.e. a number in [0, 100]. Round your answer to the nearest integer. 1. 1.arrow_forwardConsider the following set of items {A, B, D, F, H}. Create a set of transactions such that the association rule {A, D} => {F, H} would have support=0.3 and confidence 0.6.arrow_forwardConsider the following schedule that performs actions taken by transactions 71 and T2 on data items A and B T1: R(B), W(B), W(A), Commit T2: R(B). W(B). OAltisar sa OB. It is an unrecoverable schedule OC. It is a strict schedule. OD. It is a serial schedule. R(A), recoverable schedule. Abortarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781305627482Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781285196145Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos CoronelPublisher:Cengage Learning
Np Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:Cengage
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage