chapter 2 Flashcards

(70 cards)

1
Q

Give an overview for The architecture of a system?

A
  • outlines its structure, components, their functions, and interactions.
  • It involves specifying modules, interfaces, and interrelationships in terms of data within the system
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is A Reference Architecture?

A
  • Are developed by standard developers, to define standardized interfaces based on goals and context
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the Three “reference” architectures for a distributed DBMS?

A
  1. client/server systems,
  2. peer-to-peer distributed DBMS,
  3. and multi-database systems.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the ANSI/SPARC architecture?

A
  • Are the efforts of the Standards Planning and Requirements Committee (SPARC), that determine which aspects of database management systems should be standardized, if feasible
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

ANSI/SPARC architecture is a ______ approach to defining the architecture of a DBMS?

A

data logical

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

What is the focus of the ANSI/SPARC architecture?

A

it focuses on the different user classes and roles and their varying views on data.

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

What are the 3 levels / schemas of the ANSI/SPARC architecture?

A
  1. External Schema (User View)
  2. Conceptual Schema (Community View)
  3. Internal Schema (Physical View)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Explain the External Schema (User View)?

A
  • IS the way data is viewed by individual users or groups of users.
  • Defines how different user classes or roles perceive the data they are interested in.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Explain the Conceptual Schema (Community View)?

A

It provides an abstract and high-level view of the entire database, independent of the specific details of how data is stored or accessed.

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

Explain the Internal Schema (Physical View)?

A
  • Is the physical implementation of the database on the storage media.
  • It defines how data is stored, indexed, and organized.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

The separation of the external schemas from the conceptual schema enables _______ ?

A

logical data independence

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

The separation of the conceptual schema from the internal schema allows _______ ?

A

physical data independence

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

query processing, can be time-consuming, especially for complex queries.

A

True

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

SQL query itself specifies what data is needed, and specifies the optimal strategy for retrieving that data.

A

False
- it does not dictate the optimal strategy

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

What are the three key characteristics to classify the architecture schema of a DDBMS?

A

(1) the autonomy of local systems
(2) their distribution, and
(3) their heterogeneity

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

________ is the degree to which individual DBMSs can operate independently?

A

Autonomy

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

What are the Requirements of an autonomous system?

A
  • Local operations of individual DBMSs remain unaffected by their participation in the distributed system.
  • The processing of queries by individual DBMSs should not be influenced by the execution of global queries accessing multiple databases.
  • System consistency should not be compromised when individual DBMSs join or leave the distributed system.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What are Three Alternatives for Autonomous Systems in Distributed DBMS?

A
  1. Tight Integration
  2. Semiautonomous Systems
  3. Total Isolation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Explain Tight integration.

A
  • Single-image of the entire db is available, which may reside in multiple dbs.
  • From users’ POV, the data are logically integrated in one database.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

data managers are implemented in _______ ?

A
  • tightly-integrated systems so that one of them is in control of the processing of each user request
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Describe Semiautonomous Systems?

A
  • a federation of independent DBMSs that share local data.
  • Each DBMS determines which parts of its database are accessible to users of other DBMSs.
  • Not fully autonomous because they need modifications to exchange information with each other.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Explain Total Isolation.

A
  • Individual systems are stand-alone DBMSs.
  • DBMSs are unaware of the existence of other DBMSs and can’t communicate with them.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Processing user transactions that access multiple databases is challenging in _______ ?

A

total isolation autonomy

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

autonomy is the distribution of ______ while distribution is the distribution of _____ ?

A

control , data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What are we considering in Distribution?
- the physical distribution of data over multiple sites
26
What are the 2 approaches to distribute a DBMSs?
1. client/server distribution ▪ data management duties at servers 2. peer-to-peer distribution (full distribution). * Each machine has full DBMS functionality
27
What is Heterogeneity?
refers to the presence of diverse hardware, software, and network components
28
What are the Three alternative architectures?
1. client/server distributed DBMSs 2. a peer-to-peer distributed DBMS 3. a peer-to peer distributed, heterogeneous multidatabase system
29
Explain a Client/Server Architecture?
- Query processing, optimization, transaction management, and storage management are performed at the server. - The client handles the application, user interface, and manages cached data and transaction locks.
30
What are the Types of Client/Server Architecture?
Multiple Client/Single Server Multiple Client/Multiple Server
31
What are the 2 Management Strategies for CSA?
A. Client Manages Own Connection: Simplifies server code. Results in a "heavy client" system. B. Client Knows "Home Server" Concentrates data management at servers. Results in "light clients" with transparency provided at the server interface.
32
The primary distinction between client/server systems and peer to-peer ones is in the level of transparency.
False - in the architectural paradigm that is used to realize transparency.
33
What are the Elements of Peer-to-Peer Architecture?
1. Local Internal Schema (LIS): Individual internal schema definition at each site. 2. Local Conceptual Schema (LCS): Describes logical organization of data at each site, 3. Global Conceptual Schema (GCS): Describes enterprise-wide data view Supports location and replication transparencies. 4. External Schemas (ESs): User applications and access to the database are supported by external schemas.
34
_____ is Defined above the global conceptual schema to support user applications and user access to the database?
External schemas (ESs)
35
_____ handles fragmentation and replication.
Local conceptual schema (LCS).
36
_____ is the Union of local conceptual schemas.
Global conceptual schema (GCS)
37
In Peer-2Peer the distributed DBMS translates global queries into a group of local queries
True only 1 GCS to many LCS
38
What are the Two basic components in P2P?
- User processor [ ES, GCS ] - Data processor [ LCS, LIS ]
39
What are User processor Components in P2P DBMS?
- The user interface handler - The semantic data controller - The global query optimizer and decomposer - The distributed execution monitor
40
_____ Interprets user commands and formats result data for users?
The user interface handler
41
Explain the role of Semantic Data Controller?
- Uses integrity constraints from the global conceptual schema to check user processing - Responsible for authorization
42
Explain Global Query Optimizer and Decomposer?
- Determines execution strategy using global and local conceptual schemas. - Translates global queries into local ones
43
Explain Distributed Execution Monitor.
- Coordinates distributed execution of user requests. - Aka the distributed transaction manager.
44
What are Data processor Components in P2P DBMS?
1.The local query optimizer 2. The local recovery manager 3.The run-time support processor
45
______ Acts as the access path selector in data processor?
The local query optimizer
46
_____ Ensures local database consistency in the event of failures in the data processor?
The local recovery manager
47
_____ Physically accesses the database based on the schedule generated by the query optimize?
The run-time support processor
48
The local recovery manager Acts as the interface to the operating system
False The run-time support processor
49
Explain a Database Buffer (or Cache) Manager?
- Is a component contained with in the, The run-time support processor that is responsible for maintaining the main memory buffers and managing the data accesses
50
What is The fundamental difference between multi-DBMS & distributed DBMS.
the existence of full-fledged DBMSs, each of which manages a different database in multi-DBMS
51
From the perspective of individual DBMSs, the MDBS layer is just another application that submits requests and receives responses.
True
52
What are the 3 main Complications Introduced by Distribution?
1. Replication Complexity 2. Failure Complexity 3. Synchronization Problem
53
What must the Distributed database do to handle Replication Complexity?
- Choose replica to be accessed in retrievals. - Ensure updates are reflected on all replicas
54
What must the Distributed database do to handle Failure Complexity?
- System must handle failures (hardware / software) during updates. - Ensure effects are reflected on data once the system recovers.
55
What is Synchronization Problem?
The Lack of instantaneous information on actions at other sites
56
What are other Complications Introduced by Distribution?
* cost of replicating resources * managing distribution * devolution of control
57
List the Design Issues in Distributed Database Systems.
1. Distributed Database Design 2. Distributed Directory Management 3. Distributed Query Processing 4. Distributed Concurrency Control 5. Distributed Deadlock Management 6. Reliability of Distributed DBMS
58
Explain Distributed Database Design.
- Data can be Partitioned (non-replicated) or replicated. > Partitioned: Database divided into disjoint partitions at different sites. > Replicated: Fully replicated (entire database stored at each site) or partially replicated (each partition stored at multiple, but not all, sites).
59
Explain Distributed Directory Management.
Directory : - Contains information about data items in the database. - May be global or local to DDBS. - Can be centralized or distributed across sites. - Has Complex management.
60
Explain Distributed Query Processing.
- Involves designing algorithms to analyze queries and optimize their execution - Considers data distribution, communication costs, and lack of locally-available information. - Objective is to optimize performance within constraints.
61
______ involves the synchronization of accesses to the distributed database, such that the integrity of the database is maintained?
Distributed Concurrency Control
62
What is mutual consistency?
When multiple copies of every data item to converge to the same value
63
What are the fundamental primitives used in Distributed Concurrency Control?
Locking timestamping
64
_______ is based on the mutual exclusion of accesses to data items
Locking
65
What is timestamping?
where the transaction executions are ordered based on timestamps
66
intermediate results of a transaction should not be visible to other concurrently executing transactions
True
67
transanaction isolation can be ensured trivially by _______ ?
running transactions serially(timestamp)
68
What is deadlock?
occurs when two or more transactions are blocked indefinitely, each waiting for the other to release a lock.
69
What Alternatives do we have for deadlock?
prevention, avoidance, detection, and recovery.
70
Explain Reliability of Distributed DBMS.
ensure database consistency, detect failures, and recover from them.