Professional Documents
Culture Documents
DBMS CH-6
DBMS CH-6
CHAPTER SIX
02/24/2023
1
Distributed Databases System Concept
02/24/2023 2
Distributed Databases System Concept
There is Location transparency, which refers to freedom of issuing command from any
location without affecting its working.
Then there is Naming transparency, which allows access to any names object (files, relations,
etc.) from any location.
02/24/2023 4
Replication transparency:
Fragmentation transparency:
02/24/2023 5
Increased reliability and availability:
02/24/2023 6
Improved performance:
02/24/2023 7
Functions of Distributed Databases
Keeping track of data distribution. The ability to keep track of the data
distribution, fragmentation, and replication by expanding the DDBMS catalog.
Distributed query processing. The ability to access remote sites and transmit
queries and data among the various sites via a communication network.
02/24/2023 8
Distributed transaction management. The ability to devise execution
strategies for queries and transactions that access data from more than one site and to
synchronize the access to distributed data and maintain the integrity of the overall
database.
Replicated data management. The ability to decide which copy of a replicated data
item to access and to maintain the consistency of copies of a replicated data item.
02/24/2023 10
DATA FRAGMENTATION, REPLICATION AND ALLOCATION TECHNIQUES FOR DISTRIBUTED DATABASE DESIGN
Data Fragmentation
Split a relation into logically related and correct parts. A relation can be
fragmented in two ways:
Horizontal Fragmentation
Vertical Fragmentation
02/24/2023 11
Horizontal fragmentation
It is a horizontal subset of a relation which contain those of tuples which satisfy
selection conditions.
Consider the Employee relation with selection condition (DNO = 5). All tuples
satisfy this condition will create a subset which will be a horizontal fragment of
Employee relation.
02/24/2023 15
Heterogeneous
Federated: Each site may run different database system but the data
access is managed through a single conceptual schema.
This implies that the degree of local autonomy is minimum. Each site
must adhere to a centralized access policy. There may be a global schema.
application software.
02/24/2023 16
Heterogeneous
02/24/2023 17
Query Processing and Optimization in Distributed Databases
02/24/2023 19
3. Global Query Optimization. Optimization consists of selecting a
strategy from a list of candidates that is closest to optimal. A list of
candidate queries can be obtained by permuting the ordering of
operations within a fragment query generated by the previous stage.
4. Local Query Optimization. This stage is common to all sites in the
DDB. The techniques are similar to those used in centralized systems.
02/24/2023 20
Concurrency Control and Recovery in Distributed Databases
Dealing with multiple copies of the data items. The concurrency control
method is responsible for maintaining consistency among these copies. The
recovery method is responsible for making a copy consistent with other copies if
the site on which the copy is stored fails and recovers later
02/24/2023 21
Failure of individual sites. The DDBMS should continue to operate with its
running sites, if possible, when one or more individual sites fail. When a site
recovers, its local database must be brought up-to-date with the rest of the sites
before it rejoins the system.
02/24/2023 22
Failure of communication links. The system must be able to deal with
the failure of one or more of the communication links that connect the
sites. An extreme case of this problem is that network partitioning
may occur. This breaks up the sites into two or more partitions, where
the sites within each partition can communicate only with one another
and not with sites in other partitions.
02/24/2023 24