Distributed Database Systems Concepts and Objectives

Lecture 2 formalizes the conceptual definition, structural components, and primary promises of Distributed Database Management Systems. A distributed database is formally defined as a logically interrelated collection of shared data, physically distributed over a computer network, managed by a software system that confers distribution transparency. Students contrast a true DDBMS against centralized systems with remote terminals or loosely coupled timesharing setups. The lecture explores the foundational promises of DDBMS: transparent management of distributed and replicated data; high availability and fault tolerance (system survival despite node or link crashes); improved performance via localized query execution and inter-query parallelism; and graceful, modular growth allowing incremental system expansion without major software redesign. The role of distributed transactions in preserving global consistency is introduced. Key concepts such as minterm predicate generation, completeness conditions, and disjointness rules are rigorously analyzed in empirical design scenarios. The lecture details derived horizontal fragmentation mechanisms, utilizing owner-member relationships and foreign key dependencies to optimize join operations. Vertical fragmentation methodologies are demonstrated using attribute affinity matrices and the Bond Energy Algorithm to cluster frequently accessed columns. Data replication architectures, including snapshot, transactional, and merge replication models, are evaluated for operational availability and consistency. Formal transaction management frameworks analyze ACID properties in distributed environments, ensuring database integrity despite concurrent site failures. Serializability theory and conflict equivalence criteria provide mathematical foundations for proving the correctness of interleaved transaction schedules. Locking-based concurrency control protocols, including Two-Phase Locking, Distributed 2PL, and primary copy 2PL, are scrutinized for lock contention trade-offs. Distributed deadlock detection and resolution algorithms examine wait-for graphs, probe messages, and priority-based prevention strategies. Timestamp-ordering concurrency control mechanisms illustrate how physical and logical timestamps enforce serial ordering without deadlock vulnerability. Multi-version and conservative timestamp ordering algorithms are analyzed for read-heavy workloads and long-duration distributed transactions. Distributed query processing lifecycles trace query decomposition, algebraic normalization, semantic analysis, and elimination of redundant operations. Data localization algorithms transform global algebraic operator trees into localized fragment queries using relational reduction rules.