0% found this document useful (0 votes)
5 views2 pages

Parallel & Distributed Database Q&A Guide

The document is a question bank for Unit II on Parallel and Distributed Database Systems, containing questions categorized into 2 marks, 4 marks, and 6 marks. It covers various topics such as definitions, advantages and disadvantages of different architectures, transaction processing, and performance measures in parallel and distributed systems. The questions aim to assess knowledge on concepts like shared memory architecture, fragmentation types, and commit protocols.

Uploaded by

aherrohan05
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views2 pages

Parallel & Distributed Database Q&A Guide

The document is a question bank for Unit II on Parallel and Distributed Database Systems, containing questions categorized into 2 marks, 4 marks, and 6 marks. It covers various topics such as definitions, advantages and disadvantages of different architectures, transaction processing, and performance measures in parallel and distributed systems. The questions aim to assess knowledge on concepts like shared memory architecture, fragmentation types, and commit protocols.

Uploaded by

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

Question Bank – Unit II (Parallel & Distributed Database System)

2 Marks Questions
1. Define Parallel Database System.

2. What is Inter-query Parallelism? Give one example.

3. State any two advantages of Shared Memory Architecture.

4. Define Throughput in Parallel Database Systems.

5. Write any two benefits of Distributed Database System.

6. What is Horizontal Fragmentation?

7. Differentiate between Local and Global Transaction (any two points).

8. State any two disadvantages of Distributed Database Systems.

9. What is a Two-Phase Commit Protocol?

10. Define Response Time with formula.

4 Marks Questions
1. Explain Shared Disk Architecture with advantages and disadvantages.

2. Differentiate between Homogeneous and Heterogeneous Distributed Database Systems.

3. Explain Database Scaleup with suitable example.

4. Describe any four benefits of a Distributed Database System.

5. What is Speedup? Explain types of speedup with examples.

6. Compare Parallel vs Distributed Transaction Processing (any four points).

7. Explain the concept of Data Replication with advantages and disadvantages.

8. What are the challenges of Distributed Transaction Processing?

9. Explain Intra-query Parallelism with example.

10. Discuss Client-Server Distributed Database System with example.

6 Marks Questions
1. Explain Shared Nothing Architecture with neat diagram, advantages, and disadvantages.
2. Discuss measures of performance in Parallel Database Systems (Throughput, Response
Time, Scaleup, Speedup).

3. Explain different types of fragmentation in Distributed Databases with examples.

4. Describe Two-Phase Commit and Three-Phase Commit protocols with examples.

5. Compare Parallel and Distributed Database Systems in detail.

6. Explain Transaction Processing in Distributed Databases with concurrency control


methods.

7. Discuss in detail the advantages and disadvantages of Distributed Database Systems.

8. Explain Hierarchical Architecture of Parallel Database Systems with diagram.

9. Write short notes on: (i) Inter-query Parallelism, (ii) Intra-transaction Parallelism, (iii)
Intra-query Parallelism.

10. Describe various types of Distributed Database Systems with examples.

Common questions

Powered by AI

Inter-query Parallelism improves performance by allowing different queries to be executed concurrently on multiple processors, increasing throughput and maximizing resource usage . For example, in a retail environment, separate consumer report queries can run in parallel for different store locations, utilizing multiple processors simultaneously, thus reducing the time required to obtain results and improving the management of peak loads .

Shared Nothing Architecture allows each node of the database system to operate independently, with its own disks and memory, eliminating resource contention and enabling high scalability . This architecture enhances fault isolation, as the failure of one node does not impact others, ensuring more consistent performance. However, drawbacks include the complexity of data distribution and the cost associated with ensuring data remains coherent and consistent across nodes, which could complicate system management and integration .

Database scaleup refers to a parallel database system's ability to handle increased workload by adding more resources, such as processors or memory, without degrading performance . Effective scaleup is achieved by implementing architectures that minimize resource contention, such as Shared Nothing, which enhances linear scaling characteristics. Additionally, distributing data and workload evenly across processors ensures each component functions optimally without becoming a bottleneck. A balanced data partitioning strategy and an efficient inter-process communication mechanism are crucial for achieving effective scaleup .

The Two-Phase Commit Protocol enhances reliability by ensuring that a transaction regarding distributed databases is either fully completed together or fully aborted, maintaining atomicity and consistency across the network . In the first phase, a transaction manager seeks approval from all participating nodes, and in the second phase, decisions are executed worldwide if all nodes agree. The main limitation is potential increased latency due to waiting for all nodes' responses, which can lead to blockages if any node is slow or fails, impacting the overall speed and performance of transactions .

Significant challenges in Distributed Transaction Processing include network latency, data consistency, concurrency control, and fault tolerance . Network latency can slow transaction completion, impacting the system's responsiveness . Maintaining data consistency across distributed nodes is complex and can lead to inconsistencies if one of the sites is updated and others are not in sync. The concurrency control challenge arises as distributed systems need robust protocols to manage transactions across multiple nodes without conflicts. Finally, ensuring fault tolerance is vital to recover from failures without data loss, but it can be resource-intensive and may complicate system architecture .

Fragmentation in distributed databases can be horizontal, vertical, or hybrid. Horizontal fragmentation involves dividing a database table into subsets of rows, useful for data distribution across locations based on access patterns . Vertical fragmentation breaks a table into smaller tables with subsets of its columns, which helps optimize certain queries by reducing the volume of data processed. Hybrid fragmentation is a mix of both horizontal and vertical, offering a flexible strategy for tailoring data distribution to usage needs. Each type affects database management by influencing query performance, data integrity, and complexity of implementing coherent data access paths .

Response time and throughput are crucial in designing Parallel Database Systems as they directly impact user satisfaction and system efficiency. Response time measures how quickly a system processes a query, and optimizing it is essential for time-sensitive applications . Throughput, the amount of work performed within a time unit, determines how well a database can handle concurrent workloads and is improved by architectures that support high degrees of parallel processing. Effective design needs to balance these metrics by selecting suitable architectures (Shared Memory, Shared Disk, or Shared Nothing) and optimizing query execution strategies to avoid bottlenecks, ensuring both prompt response and high volume processing capabilities .

A Parallel Database System is designed to perform coordinated processing of a query through multiple processors or systems that share the same database. This architecture aims for a high level of speedup and scaleup in complex querying by utilizing parallel processing . In contrast, a Distributed Database System spreads data across multiple sites and systems. Each site operates independently, and data is stored closer to its point of usage, which enhances data availability and reliability . The main difference lies in architecture: parallel systems often enhance performance through shared resources (Shared Memory, Shared Disk, or Shared Nothing), while distributed systems emphasize coherence and autonomy of the data sites. This means parallel systems are better for intensive data processing tasks, while distributed systems excel in environments requiring high availability and data location optimization .

Data Replication involves copying data across multiple databases to ensure data availability and reliability . Advantages include improved data accessibility and fault tolerance; data is easily available even if one site fails. However, replication introduces challenges such as data consistency issues, where updates in one database need to be propagated to others, inducing latency and potential conflicts, along with the increased complexity of managing multiple data copies .

Data fragmentation enhances distributed databases by optimizing data access and storage; it allows data to be stored near its usage location, which reduces access latency and improves locality of reference . However, fragmentation complicates implementation as it adds complexity to query processing, requiring sophisticated algorithms for reconstructing fragments during data retrieval. Additionally, maintaining data consistency across fragmented pieces necessitates robust synchronization mechanisms, increasing the system's overall management complexity .

You might also like