Derived Horizontal Fragmentation Principles
Lecture 17 investigates Derived Horizontal Fragmentation (DHF), where the horizontal partitioning of a member relation (such as Order_Line or Employee) is governed by selection predicates defined on a related owner relation (such as Order or Department). DHF is linked through foreign key referential integrity constraints. The primary motivation for DHF is distributed join optimization: by co-locating matching horizontal fragments of both owner and member relations at the same physical sites, frequent join queries can be executed purely as localized parallel joins without incurring expensive cross-network data shuffling. Students examine formal definitions of owner-member links, analyzing how semi-join operations are used in the algebraic specification of derived horizontal fragments across database nodes. 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. Heuristic query optimization techniques illustrate how selection and projection operations are pushed down close to local physical fragments. Cost-based query optimization models analyze CPU overhead, disk page access costs, and communication network transmission delays. 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.
No questions available yet.
There are currently no examination questions published for Derived Horizontal Fragmentation Principles. Explore other curriculum units or build a custom quiz with the practice builder.