Distributed Transparency

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

DISTRIBUTED TRANSPARENCY

Data distribution transparency allows the user to perceive the database as a single, logical
entity. In other words, distribution transparency refers to the degree or extent to which details
of fragmentation (fragmentation transparency), replication (replication transparency) and
distribution (location transparency) are hidden from users. If a user sees all fragmentation,
allocation, and replication, the distributed DBMS is said to have no distribution transparency.
The user needs to refer to specific fragment copies by appending the site name to the relation.
If the user needs to know that the data are fragmented and the location of fragments for
retrieving data, then it is called local mapping transparency.

 It is the property of distributed databases by the virtue of which the internal details of
the distribution are “hidden” from the users.
 Transparency system “hiding” details from the users.

Levels of Distributed Transparency

1. Fragmentation Transparency

2. Location Transparency

3.Local Mapping Transparency

4.Replication Transparency

1. Fragmentation Transparency

 The user is not aware of the existence of fragments and work on global relations.
 Ensures that the user is not aware of and is not involved in the fragmentation of data.

Example 4.1

Let us consider the relation Employee (emp-id, emp-name, designation, salary, emp-
branch,project-no) is fragmented and stored in different sites of a distributed DBMS.
Further assume that the distributed DBMS has fragmentation transparency and, thus, users
have no idea regarding the fragmentation of the Employee relation. Therefore, to retrieve
the names of all employees of branch number 10 from Employee relation, the user will
write the following SQL statement:
Select emp-name from Employee where emp-branch 10.

This SQL statement is same as centralized DBMS.


2.Location Transparency

 The user is aware of the fragments but it is not aware of the site of which they have
been deployed.
 Ensures that the users can query on any table(s) or fragment(s) of a table as if were
stored locally in the user’s site.

Example 4.2

Let us assume that the tuples of the above Employee relation is horizontally partitioned into
two fragments EMP1 and EMP2 depending on the selection predicates “emp-id < 100” and
“emp-id > 100”. Hence, the user is aware that the Employee relation is horizontally
fragmented into two relations EMP1 and EMP2, but they have no idea in which sites these
relations are stored. Thus, the user will write the following SQL statement for the above
query “retrieve the names of all employees of branch number 10”:

Select emp-name from EMP1 where emp-branch 10

union

Select emp-name from EMP2 where emp-branch 10.

3.Local Mapping Transparency

 The users is aware of the fragments and sites on which they have been deployed.But he
is insulated from the heterogeneity aspects.

Example 4.3
Let us consider the relation Project (project-id, project-name, project-type, project-
leader-id, branch-no, amount) is horizontally partitioned into two fragments P1 and P2
depending on the project-type “inside” and “abroad”. Assume that the fragmented relations
P1 and P2 are replicated and stored in different sites of the distributed DBMS. With local
mapping transparency, the user will write the following SQL statement for the query
“retrieve project names and branch numbers of all the projects where the project amount is
greater than Rs. 10,000,000”:

Select project-name, branch-no from copy1 of P1 at site 1 where amount > 10000000
union
Select project-name, branch-no from copy3 of P2 at site 4 where amount > 10000000

Hence, it is assumed that replicas of fragments P1 and P2 of the Project relation are allocated
to different sites of the distributed system such as site1, site3, and site4.
4.Replication Transparency

 Ensures that the users is not involved in the management of copies of same data.
 Ensures that replication of database are hidden from the user.

Example 4.4
Let us assume that the horizontal fragments EMP1 and EMP2 of the Employee relation in
previous example 4.1 are replicated and stored in different sites of the distributed system.
Further, assume that the distributed DBMS supports replication transparency. In this case,
the user will write the following SQL statement for the query “retrieve the names of all
employees of branch number 20 whose salary is greater than Rs. 50,000”:

Select emp-name from EMP1 where emp-branch _ 20 and salary > 50,000
union
Select emp-name from EMP2 where emp-branch _ 20 and salary > 50,000.

If the distributed system does not support replication transparency, then the user will write
the following SQL statement for the above query considering there are a number of replicas
of fragments EMP1 and EMP2 of Employee relation:

Select emp-name from copy1 of EMP1 where emp-branch _ 20 and salary > 50,000
union
Select emp-name from copy3 of EMP2 where emp-branch _ 20 and salary > 50,000.

Similarly, the above query can be rewritten as follows for a distributed DBMS with
replication transparency which does not exhibit location transparency:

Select emp-name from EMP1 at site 1 where emp-branch _ 20 and salary > 50,000
union
Select emp-name from EMP2 at site 3 where emp-branch _ 20 and salary > 50,000.

**************************END OF FIRST MODULE*********************************

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy