1

Distributed Database A logically interrelated collection of shared data (and a description of this data), physically distributed over a computer network. Distributed DBMS Software system that permits the management of the distributed database and makes the distribution transparent to users.

Concept:
LOCAL APPLICATION Those that do not require data from other sites. GLOBAL APPLICATION Those that do require data from other sites.

TYPES OF DISTRIBUTED DATABASE

Homogeneous: Every site runs the same type of DBMS u All sites use same DBMS product. Much easier to design and manage. Approach provides incremental growth and allows increased performance. Heterogeneous: Different sites run different DBMS (maybe even RDBMS and ODBMS) u Sites may run different DBMS products, with possibly different underlying data models. u Occurs when sites have implemented their own databases and integration is considered later. u Translations required to allow for: Different hardware. Different DBMS products. Different hardware and different DBMS products. u Typical solution is to use gateways.

STRUCTURE OF DISTRIBUTED DATABASE

u A distributed database system consists of a collection of sites, each of which maintain a local database system. u Each site is able to process local transactions, those transactions that access data only in a single site u In addition a site may participate in the execution of global transactions, those transaction that access data in several sites. The execution of global transactions requires communication along the sites. u The sites in the system can be connected physically in a variety of ways. u u u u u The major differences among these configurations involve: Installation cost: The cost of physically linking the site Communication Cost: - The cost in time and money from sending a message from site A to site B Reliability : The frequency with which a link or site fails Availability : The degree to which data can be accessed despite the failure of some links or sites. 4

Advantages of DDBMSs u Reflects organizational structure u Improved shareability and local autonomy u Improved availability Availability is the probability that the system is continuously available during a time interval. u Improved reliability The probability that a system is running (not down) at certain point in time. u Improved performance Data is kept closer to where it is needed most. Data localization reduces the contention for CPU and I/O services and simultaneously reduces access delays involved in wide area networks. Smaller databases exist at each site. As a result, local queries and transactions accessing data at a single site have better performance because of the smaller databases. u Economics u Modular growth Expansion of system in terms of adding more data, increasing database sizes or adding more processors is much easier. Disadvantages of DDBMSs u Complexity u Cost u Security u Integrity control more difficult u Lack of standards u Lack of experience u Database design more complex

DESIGN OF DISTRIBUTED DATABASES

Fragmentation Relation may be divided into a number of sub-relations, which are then distributed. 2 types:-Horizontal are subsets of tuples and vertical are subsets of attributes Allocation Each fragment is stored at site with optimal distribution. Replication Copy of fragment may be maintained at several sites.

Fragmentation
Enables placement of data in close proximity to its place of use This can reduce transmission cost (imagine sending 100 GB of data over a WAN) This can also reduce the size of relations used in queries (imagine a branch office requesting local sales information)

Vertical fragmentation: Horizontal fragmentation:

Replace relation by a collection of relations that are selections Each new relation has same schema as the original, but a subset of the rows Collectively, new relations contain all rows of the original Locate the sub-relations geographically as appropriate Many database vendors provide specific syntax for horizontal fragmentation Relation is replaced by a collection of relations that are projections Retain primary key in every projection

Eg:

(its now natural join)

10