Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
DBMS Korth Edition 4 Exercise 16 Question 7 (Page No. 633)
akash.dinkar12
asked
in
Databases
Apr 1, 2019
208
views
0
votes
0
votes
Show by example that there are schedules possible under the tree protocol that are not possible under the two-phase locking protocol, and vice versa.
korth
databases
transaction-and-concurrency
descriptive
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
208
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
akash.dinkar12
asked
in
Databases
Apr 1, 2019
357
views
DBMS Korth Edition 4 Exercise 16 Question 12 (Page No. 633-634)
Locking is not done explicitly in persistent programming languages. Rather, objects (or the corresponding pages) must be locked when the objects are accessed. Most modern operating systems allow the user to set access ... how the access-protection mechanism can be used for page-level locking in a persistent programming language.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
357
views
korth
databases
transaction-and-concurrency
descriptive
0
votes
0
votes
0
answers
2
akash.dinkar12
asked
in
Databases
Apr 1, 2019
657
views
DBMS Korth Edition 4 Exercise 16 Question 11 (Page No. 633)
Consider a variant of the tree protocol called the forest protocol. The database is organized as a forest of rooted trees. Each transaction $T_i$ must follow the following rules: $ $ The first lock in each tree may be on ... relocked by Ti after it has been unlocked by $T_i$. Show that the forest protocol does not ensure serializability.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
657
views
korth
databases
transaction-and-concurrency
descriptive
0
votes
0
votes
0
answers
3
akash.dinkar12
asked
in
Databases
Apr 1, 2019
508
views
DBMS Korth Edition 4 Exercise 16 Question 10 (Page No. 633)
Consider the following graph-based locking protocol that allows only exclusive lock modes, and that operates on data graphs that are in the form of a rooted directed acyclic graph. $ $ A transaction can lock any vertex first ... a lock on one of the parents of the vertex. Show that the protocol ensures serializability and deadlock freedom.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
508
views
korth
databases
transaction-and-concurrency
descriptive
0
votes
0
votes
0
answers
4
akash.dinkar12
asked
in
Databases
Apr 1, 2019
251
views
DBMS Korth Edition 4 Exercise 16 Question 9 (Page No. 633)
Consider the following graph-based locking protocol, which allows only exclusive lock modes, and which operates on data graphs that are in the form of a rooted directed acyclic graph. $ $ A transaction can lock any ... lock on the majority of the parents of that vertex. Show that the protocol ensures serializability and deadlock freedom.
akash.dinkar12
asked
in
Databases
Apr 1, 2019
by
akash.dinkar12
251
views
korth
databases
transaction-and-concurrency
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
