Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider a variant of the tree protocol called the forest protocol. The databaseis organized as a forest of rooted trees. Each transaction Ti must follow thefollowing rules:• The first lock in each tree may be on any data item.• The second, and all subsequent, locks in a tree may be requested only ifthe parent of the requested node is currently locked.• Data items may be unlocked at any time.• A data item may not be relocked by Ti after it has been unlocked by Ti.Show that the forest protocol does not ensure serializability.

Consider a variant of the tree protocol called the forest protocol. The databaseis organized as a forest of rooted trees. Each transaction Ti must follow thefollowing rules:• The first lock in each tree may be on any data item.• The second, and all subsequent, locks in a tree may be requested only ifthe parent of the requested node is currently locked.• Data items may be unlocked at any time.• A data item may not be relocked by Ti after it has been unlocked by Ti.Show that the forest protocol does not ensure serializability.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%

Consider a variant of the tree protocol called the forest protocol. The database
is organized as a forest of rooted trees. Each transaction Ti must follow the
following rules:
• The first lock in each tree may be on any data item.
• The second, and all subsequent, locks in a tree may be requested only if
the parent of the requested node is currently locked.
• Data items may be unlocked at any time.
• A data item may not be relocked by Ti after it has been unlocked by Ti.
Show that the forest protocol does not ensure serializability.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS