Scribd
Upload
3 views3 pages

Explanation

The document discusses the need for Database Management Systems (DBMS) to address issues of data redundancy and inefficiency in old systems. It highlights the benefits of Distributed Databases (DDB) and Distributed Database Management Systems (DDBMS), including reliability, performance, scalability, and transparency. The document also outlines the challenges of designing and maintaining DDBs, emphasizing their complexity and suitability for large, decentralized organizations.

Uploaded by

mrsshantaadhikari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
3 views3 pages

Explanation

The document discusses the need for Database Management Systems (DBMS) to address issues of data redundancy and inefficiency in old systems. It highlights the benefits of Distributed Databases (DDB) and Distributed Database Management Systems (DDBMS), including reliability, performance, scalability, and transparency. The document also outlines the challenges of designing and maintaining DDBs, emphasizing their complexity and suitability for large, decentralized organizations.

Uploaded by

mrsshantaadhikari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

### **Page 1: Data Independence**

- **Old System Problems**:


- Programs stored data in separate files, each with its own description.
- This caused redundancy (repeating data), high maintenance, and errors.
- **Example**:
- Three programs (Program 1, 2, 3) each manage their own files (File 1, 2, 3),
leading to inefficiency.

**Key Idea**:
- A better system (like a Database Management System, or DBMS) is needed to
centralize data and reduce redundancy.

---

### **Page 2: Data Independence (Continued)**


- **DBMS Benefits**:
- Centralized control: One system manages all data.
- Applications don’t need to worry about how data is stored (physical/logical
organization).
- **Distributed Databases**:
- Combines databases and networks.
- Goal: Integrate data across locations without forcing centralization.
- Users see one unified system, even if data is spread out.

---

### **Page 3: Distributed Computing/Data Processing**


- **Definition**:
- A system where multiple independent computers (connected via a network) work
together.
- **What’s Distributed?**
- Processing, functions, data, or control can be spread across locations.
- **Types of Systems**:
- **Coupling**: How tightly connected the computers are (weak or strong).
- **Sync**: Tasks can run simultaneously (async) or in sync (sync).

---

### **Page 4: Definition of DDB and DDBMS**


- **Distributed Database (DDB)**:
- Multiple databases linked logically over a network.
- **DDBMS**:
- Software managing the DDB, making distribution invisible to users.
- **Assumptions**:
- Data is stored at multiple sites (not files).
- Uses relational databases (not simple file systems).

**Visual**:
- Sites (1, 2, 3, etc.) connected via a network.

---

### **Page 6: Applications & Promises of DDBS**


- **Where Used?**
- Manufacturing, military, airlines, hotels—any decentralized organization.
- **Advantages**:
1. **Reliability**: No single point of failure; backups exist.
2. **Performance**: Faster access (data closer to users).
3. **Scalability**: Easy to expand (add more computers).
4. **Transparency**: Users see one system, not the complexity.

---

### **Page 7: Promises of DDBS (Reliability & Performance)**


- **Reliability**:
- Replicated components ensure no total failure (e.g., if one link breaks, others
work).
- **Performance**:
- Data placed near users reduces delays.
- Parallel processing speeds up queries.
- Replication helps read-heavy systems but complicates updates.

---

### **Page 8: Promises (Easier Expansion & Transparency)**


- **Expansion**:
- Cheaper to add workstations than upgrade a mainframe.
- **Transparency**:
- Hides technical details (e.g., users see one database, programmers see many).

---

### **Page 9-10: Types of Transparency**


1. **Network Transparency**:
- Users don’t need to know where data is stored (location/naming transparency).
2. **Replication Transparency**:
- Users unaware of duplicate data (managed by the system).
3. **Fragmentation Transparency**:
- Data split (e.g., by rows or columns) without user involvement.

**Naming Solutions**:
- Central server (risky) or site prefixes (e.g., `S1.BRANCH`).

---

### **Page 11-12: Transaction & Performance Transparency**


- **Transaction Transparency**:
- Ensures all parts of a distributed transaction succeed or fail together.
- **Concurrency Transparency**:
- Parallel transactions don’t interfere (like a centralized system).
- **Failure Transparency**:
- System recovers even if sites/networks fail.

**Performance Transparency**:
- Queries run efficiently, considering fragments, copies, and network costs.

---

### **Page 13: Challenges**


- **Complications**:
- Harder to design, secure, and maintain.
- No universal standards; expertise is limited.

---

### **Page 14: Conclusion**


- **DDB**: Logically connected databases over a network.
- **Key Features**:
- Transparency (hides distribution, network, transaction details).
- Requires careful design, query handling, and reliability measures.

**Final Note**:
- DDBs are powerful but complex—ideal for large, decentralized organizations.

You might also like