Query Decomposition and Normalization
Lecture 37 details the first phase of distributed query processing: Query Decomposition. The decomposition module transforms a declarative SQL query into a standardized relational algebra operator tree over global conceptual relations. The process encompasses four distinct sub-stages: lexical analysis and parsing (validating SQL syntax and generating internal parse trees); semantic analysis (verifying attribute names, relation existence, and type compatibility against the global data dictionary); normalization (transforming complex selection predicates into Conjunctive Normal Form or Disjunctive Normal Form using De Morgan's laws); and algebraic rewriting (converting normalized predicates into an initial relational algebra query tree). Common syntactic errors and semantic validation algorithms are analyzed. The curriculum systematically aligns theoretical relational models with modern distributed database systems and cloud-native storage infrastructure. Reviewing the accompanying lecture handouts and conceptual diagrams reinforces understanding of distributed schema architectures and catalog management. Consistent evaluation of distribution design trade-offs, network bandwidth constraints, and local autonomy ensures robust preparation for academic assessments. Students investigate the role of global data dictionaries and catalog managers in resolving location-independent queries across networked nodes. The discussion highlights how horizontal and vertical data fragmentation techniques reduce disk I/O, minimize message traffic, and maximize localized query execution. 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.
No questions available yet.
There are currently no examination questions published for Query Decomposition and Normalization. Explore other curriculum units or build a custom quiz with the practice builder.