Distributed Database Systems

3.

Data Distribution Design

3.1.

Design Methodologies

3.1.1.

Top-Down Design

3.1.1.1.

Global Schema Design

3.1.1.2.

Fragmentation and Allocation

3.1.1.3.

Requirements Analysis

3.1.2.

Bottom-Up Design

3.1.2.1.

Integration of Existing Databases

3.1.2.2.

3.1.2.3.

Federated Approach

3.1.3.

Mixed Design Approach

3.2.

Data Fragmentation

3.2.1.

Reasons for Fragmentation

3.2.1.1.

Improved Performance

3.2.1.2.

Locality of Access

3.2.1.3.

Security and Privacy

3.2.1.4.

Parallel Processing

3.2.2.

Correctness Rules of Fragmentation

3.2.2.1.

3.2.2.2.

3.2.2.3.

3.2.3.

Types of Fragmentation

3.2.3.1.

Horizontal Fragmentation

3.2.3.1.1.

Primary Horizontal Fragmentation

3.2.3.1.2.

Derived Horizontal Fragmentation

3.2.3.1.3.

Fragmentation Predicates

3.2.3.2.

Vertical Fragmentation

3.2.3.2.1.

Attribute Partitioning

3.2.3.2.2.

Reconstruction via Joins

3.2.3.2.3.

Primary Key Handling

3.2.3.3.

Mixed Fragmentation

3.2.3.3.1.

Combination of Horizontal and Vertical

3.2.3.3.2.

3.2.4.

Fragmentation Algorithms

3.2.4.1.

Horizontal Fragmentation Algorithms

3.2.4.2.

Vertical Fragmentation Algorithms

3.2.4.3.

Cost-Based Fragmentation

3.3.

Data Allocation

3.3.1.

Allocation Strategies

3.3.1.1.

Centralized Allocation

3.3.1.2.

Partitioned Allocation

3.3.1.3.

Replicated Allocation

3.3.1.3.1.

Full Replication

3.3.1.3.2.

Partial Replication

3.3.2.

Factors in Allocation Decisions

3.3.2.1.

Data Access Patterns

3.3.2.2.

Communication Costs

3.3.2.3.

3.3.2.4.

Reliability and Availability Requirements

3.3.2.5.

Update Frequency

3.3.2.6.

Site Capabilities

3.3.2.7.

Network Topology

3.3.3.

Allocation Algorithms

3.3.3.1.

Static Allocation

3.3.3.2.

Dynamic Allocation

3.3.3.3.

Optimal Allocation Models

Previous

2. Distributed Database Architecture

Go to top

Next

4. Distributed Query Processing