DDBS 1 Flashcards

1
Q

Distributed Computing:

A

A number of autonomus processing elements (not necessarily homegeneous) that are interconection by a computer network and that cooperate in performing their assigned task

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is being distributed?

A

Function, Data and Control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Distributed function:

A

Various function of a computer system could be delegated to various pieces of hardware or software

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Distributed data:

A

Data used by number of applications may be distributed to a number of processing sites.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Distributed control:

A

The control of the execution of various tasks might be distributed instead of being perfomed by one computer system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why do we ditributed all?

A

Distributed processing better understads to the organization structure of today’s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What applications of computer technology are inherent to distributed architectures?

A

-Web aplicactions
-Electronic commerce business
-Multimedia applications
-Manufacturing control systems
-Cloud Computing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Distributed database(DDB):

A

is a collection of multiple, logically interrelated database distributed over a computer network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Distributed database management system (D-DBMS)

A

is the software that manages the DDB and provides an access mechanism that makes this distribution transparents to the users

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Distributed database system(DDBS):

A

DDBS= DDB + D-DBMS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

whats is not a DDBS

A

-Is not a “Colection of files” individually stored at each node of a computer network
-Only physical distribution
-A timesharing computer system
-A loosely or tightly coupled multiprocessor system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Data Delivery

A

Is related to how data is delivery from sites where they are stored to where the query is posed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Ther are three ortogonal dimensions into data delivery alteratives(DDA)

A

-Delivery modes
-Delivery frequency
-Communication methods

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Delivery modes:

A

Pull-only and Push-only

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Pull-only:

A

The transfer of data from servers to clients is initiated by a client pull.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Push-Only:

A

the transfered of the data from servers to client is initiated by a server push in the absence of any specific request from clients

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Hybrid

A

The hybrid mode combines the client-pull and server-push mechanisms

17
Q

Fecuency periodic:

A

In periodic delivery data are sent from the server to clients at regular intervals

17
Q

Frequency Ad-hoc or irregular:

A

This delivery is performed mostly in a pure pull-based system

17
Q

Fequency conditional:

A

In this delivery, data are sent from servers whenever certain conditions installed by clients in their profiles are satisfied

18
Q

Communication methods unicast:

A

In this method, the communication is performed from a server to a client in a one-to-one fashion

19
Q

Communicaction methods One-to-many

A

In this method, as the name implies, the server sends data to a number of clients

20
Q

Ditributed DBMS promises

A

1.- Transparent management of distributed, fragmeted, and replicanted data
2.- Improved reliavility / availability
3.- Improved performance
4.- Easier and more economical system expansion

21
Q

Data independece

A

Is a fundamental form of transparency that we look for within a DBMS.

22
Q

Network transparency (or distribution transparency)

A

This is concerned with the user protection from the operational details of the network.

23
Q

Location transparency:

A

This refers to the fact that command used to perform a task is independent of both location of the data

24
Q

Naming transparency:

A

This means that a unique name is provided for each object in the database.

25
Q

Replication transparency:

A

For performance, reliability, and availability reasons, it is usually desirable to be able to distribute data in a replicated fashion across machines on a network

26
Q

Fragmentation transparency:

A

Sometimes, it is commonly desirable to divide each database relation into smaller fragments and treat each fragment as a separate database object

27
Q

Distributed concurrency control protocols:

A

They are protocols that control simultaneous transactions in distributed databases

28
Q

Commit protocols:

A

Protocols that are capable of perform commits operations and recovery unfinished transactions

29
Q

Inter-query parallelism:

A

This results from the ability to execute multiple queries at the same time

30
Q

Intra-query parallelism:

A

This is achieved by breaking up a single query into several subqueries each of which is executed at a different site

31
Q

First Normal Form (1NF)

A

Eliminate the partial functional dependencies of non-prime attributes to key attributes

32
Q

Second Normal Form (2NF)

A

Eliminate the transitive functional dependencies of non-prime attributes to key attributes

33
Q

Third normal form(3NF)

A

Eliminate the partial and transitive functinal dependencies of prime (key) attributes to key

34
Q

Outer-Join

A

Inner join requires the joined tuples from two operand relations to satisfy the join predicate.

35
Q

The semijoin

A

the semijoin of relation R, defined over the set of attributes A, by relations S, defined over the set of attributes B, is the subset of tumples of R that participate in the join of R with S

36
Q

Computer Network

A

An interconected collection of autonomous computes that are capable of exchanging information among themselves

37
Q

Computer Network Components

A

Host (node, end systems) Switches communication link

38
Q
A