Propose a relation schema for storing the access rights associated with user groups in a distributed database catalog, and give a fragmentation scheme for that relation, assuming that all members of a group are at the same site.

Propose a relation schema for storing the access rights associated with user groups in a distributed database catalog, and give a fragmentation scheme for that relation, assuming that all members of a group are at the same site.

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

Similar questions

Distributed Database Systems have the same problem of concurrency control as other distributed systems. Would it be necessary to apply concurrency management methods such as 2PL(Two-phase locking) in a situation where fragments are not replicated? Explain?
Consider a database system that leverages snapshot isolation for an airline. Describe a situation in which a nonserializable execution happens, but the airline is ready to tolerate it to improve overall performance.
Explain Concurrence management is a problem for distributed database systems just as it is for any other distributed system. Should 2PL (two-phase locking) strategies be used if no replicating pieces exist?
Describe the CAP theorem and its implications for distributed database design and operation.
Consider a database system for a bank that employs snapshot isolation. Describe a specific situation in which a non-serializable execution might cause an issue for the bank.
A multi-user database system is used to support the customer payment operations of a XYZ store. Unfortunately, the system currently does not enforce concurrent control on transactions accessing and updating the data. A particular customer had a balance due of HK$ 300 when the following three transactions related to the customer were processed at the same time: (i) Payment of HK$ 300; (ii) Purchase on credit of HK$ 150; and (iii) Merchandise return (credit) of HK$ 100. Each of the three transactions read the customer record when the balance was HK$ 300. That is, all transactions have read the record before any of them was completed. The updated customer record was returned from the transactions to the database in the order of first (i), then (ii) and finally (iii). (a) After the last transaction was completed, what balance will be recorded for the customer? (b) What balance should be actually recorded for the customer after the three transactions have been processed?
Take, for example, a database for an airline, where the database system makes use of snapshot isolation. A nonserializable execution may occur, but the airline may be ready to tolerate it in order to get better overall performance.
Consider a database system for an airline that employs snapshot isolation. Describe a situation in which a non serializable execution happens, but the airline is ready to tolerate it in exchange for improved overall performance.
Experiment with all of the possible data request scenarios in a distributed database system.
Q. The database interface of a library allows searching only for a single attribute (such as Titleor Author ) in each query. Your friend decided to extend it's functionality and wrote an algorithm that allowssearching for books that satisfy multiple predicates over single attributes in conjunction. He tells you the algorithmreuses the already implemented query functionality and works by intersecting the results ( book id's ) of queriesover single attributes.Which of the following assumptions on your friend's algorithm are plausible?a) Its worst-case run-time necessarily increases exponentially with respect to the number of attributes in thequery.b) Its worst-case run-time depends on the length of the longest result of the single-attribute queries.c) It might be implemented using an join.d) It might be implemented using sorting.
Describe the concepts of transparency in distributed database systems, including location transparency, replication transparency, and fragmentation transparency.
Concurrency control problems in distributed database systems are similar to those in other kinds of distributed systems. Is it required to use concurrency management techniques such as two-phase locking (2PL) in a setup where parts are not duplicated? Explain.