Objectives and Principles of Data Fragmentation

Lecture 12 investigates why global database relations should not be stored as monolithic tables in distributed systems, introducing the principles and objectives of data fragmentation. Data fragmentation decomposes global relations into smaller logical units (sub-tables) based on user access locality. The lecture details the core benefits of fragmentation: maximizing local access locality (storing data close to the applications that query it most frequently); reducing local table sizes to accelerate index lookups; enabling intra-query parallelism across multiple processors; and improving data security by restricting sensitive columns or rows to authorized local sites. The lecture also critically evaluates fragmentation drawbacks, including performance penalties when global queries require distributed reconstructive joins or cross-site unions, and increased catalog complexity. Distributed join optimization strategies contrast broadcast joins, partitioned hash joins, and semi-join reducers like the SDD-1 algorithm. Distributed reliability architectures examine failure classifications, including transaction aborts, site crashes, and network partitioning anomalies. Atomic commitment protocols, notably Two-Phase Commit (2PC) and Three-Phase Commit (3PC), are demonstrated with formal state transition diagrams. Parallel database system architectures, spanning Shared-Memory, Shared-Disk, and Shared-Nothing topologies, are contrasted for speedup and scaleup performance. Parallel data placement techniques, including round-robin, hash partitioning, and range partitioning, illustrate workload balancing across processing nodes. Parallel join algorithms evaluate parallel nested-loop, associative, and parallel hash join executions in high-throughput query environments. Distributed Object-Oriented Database Management Systems (OODBMS) explore object identity, encapsulation, complex object hierarchies, and pointer swizzling. Client-server and page-server architectures in distributed OODBMS are analyzed for cache coherence, client caching, and transaction synchronization. Multidatabase and federated database systems illustrate how schema integration and mediation resolve semantic heterogeneity across legacy data stores. Exam preparation summaries and solved handout excerpts reinforce retention of critical mathematical proofs, fragmentation formulas, and execution algorithms. Comprehensive review of Virtual University exam patterns, past solved papers, and practice MCQs consolidates theoretical mastery and practical design competence. Systematic preparation on VU SIGMA empowers students to achieve outstanding grades in university examinations through structured practice and verified feedback.