QUESTION ON DISTRIBUTED DATABASED SYSTEM

1) Each file is independent from another file.

Each file is called flat file.
Each file contains processed information only.

Traditional Databases Distributed Databases

Made up of tables of data that are related Data distribution is necessary for
to one another scalability

All of the data is located in one place Information is spread across various
and is easily accessible servers (instances)

Related data can be distributed into

The data relationship is stored deep in
different partitions, or shards, making
the database and can be easily analyzed
related query requests difficult to
and queried using conventional methods
process

2) Database applications are software programs designed to collect, manage and

disseminate information efficiently.
Types include
 Centralised Database: The information(data) is stored at a centralized location
and the users from different locations can access this data. This type of
database contains application procedures that help the users to access the data
even from a remote location.
 Distributed Database: This database has contributions from the common
database as well as the information captured by local computers also. The data
is not at one place and is distributed at various sites of an organization. These
sites are connected to each other with the help of communication links which
helps them to access the distributed data easily.
 Personal Database: Data is collected and stored on personal computers which
is small and easily manageable. The data is generally used by the same
department of an organization and is accessed by a small group of people.
 End user Database: The end user is usually not concerned about the
transaction or operations done at various levels and is only aware of the
product which may be a software or an application. Therefore, this is a shared
database which is specifically designed for the end user, just like different
levels’ managers.
 Commercial Database: These are the paid versions of the huge databases
designed uniquely for the users who want to access the information for help.
 These databases are subject specific, and one cannot afford to maintain such a
huge information.
 Relational Database: These databases are categorized by a set of tables where
data gets fit into a pre-defined category. The table consists of rows and
columns where the column has an entry for data for a specific category and
rows contains instance for that data defined according to the category. The
Structured Query Language (SQL) is the standard user and application
program interface for a relational database.
3) Types of Communication Networks in Organizations

 Chain Network:In chain network, communication travels up and down through the
hierarchy. Each person communicates with only the person directly above or below in
terms of reporting relationships. The chain network rigidly follows the formal chain
of command.
 Y Network: In the Y network, the flow of communication resembles an upside down
Y; information flows upward and downward through the hierarchy, widening to
encompass the number of employees reporting to a supervisor.
 Wheel Network: In a wheel network, information flows to and from a single person.
Employees in the group communicate primarily with that person rather than with each
other. Such a communication network is a fast means of getting information to
employees, since the person at the hub of the wheel can do so directly and efficiently.
 Circle Network: In a circle network, employees communicate only with adjoining
members of the organization. The circle network is analogous to a group working in a
physical arrangement such that workers can communicate with their immediate
neighbour but not with others in the group.
 The All-Channel Network or the Star Network: In an all-channel network,
communications flow upward, downward and laterally among all members of the
group. The all-channel network is best if you are concerned with having high member
satisfaction. The circle network and the all-channel network are more decentralized in
that there is freer communication among the various members.

4) DB fragmentation means the breakup of an entity into smaller logical units of

distribution.
 There are three rules 1. The complete character. 2. The reconstruction. 3. the disjoint
character.

A horizontal fragment is a subset of the relation’s tuple. It results through the

specification of a predicate which imposes a restriction upon the relation’s tuples.
Horizontal fragmentation is obtained through the application of the selection
operation from the relational algebra, by grouping the tuples which have a common
priority

5) Transparency refers to the transparent distribution of information to the user from

the system. It helps in the hiding the information that is to be implemented by the user