database systems thae complete book 2nd ed

[...]... 5 2 718 Nested-Loop J o i n s 718 15.3.1 Tuple-Based Nested-Loop J o i n 719 15.3.2 An Iterator for Tuple-Based Nested-Loop Join 719 15.3.3 Block-Based Nested-Loop Join A lg o rith m 719 15.3.4 Analysis of Nested-Loop J o i n .721 15.3.5 Summary of Algorithms so F a r 722 15.3.6 Exercises for Section 1 5 3 722 Two-Pass Algorithms Based on Sorting 723... 862 17.3 Redo Logging 863 17.3.1 The Redo-Logging R u l e 863 17.3.2 Recovery With Redo L ogging .864 17.3.3 Checkpointing a Redo L og 866 17.3.4 Recovery With a Checkpointed Redo L o g 867 17.3.5 Exercises for Section 1 7 3 868 17.4 Undo/Redo L o g g in g 869 17.4.1 The Undo/Redo R u le s 870 17.4.2 Recovery With Undo/Redo L o g g in... she received the ACM SIGMOD Edgar F Codd Innovations Award in 2007 and was a Guggenheim Fellow in 2000, and she has served on a variety of program committees, advisory boards, and editorial boards Table o f Contents 1 T h e W orld s o f D a ta b a se S y ste m s 1.1 1.2 1.3 1.4 1 2 The Evolution of Database Systems 1.1.1 Early Database Management S y s te m s 1.1.2 Relational Database S... experience GOAL delivers immediate assessment and feedback via two kinds of assignments: mul­ tiple choice homework exercises and interactive lab projects The homework consists of a set of multiple choice questions designed to test student knowledge of a solved problem When answers are graded as incorrect, students are given a hint and directed back to a specific section in the course textbook for helpful information... verifies that it returns the correct result By testing the code and providing immediate feed­ back, GOAL lets you know exactly which concepts the students have grasped and which ones need to be revisited In addition, the GOAL package specific to this book includes programming exercises in SQL and XQuery Submitted queries are tested for correctness and incorrect results lead to examples of where the query... 21.1.2 The Heterogeneity P ro b le m 1040 21.2 Modes of Information In teg ratio n 1041 21.2.1 Federated Database Systems 1042 21.2.2 Data W arehouses 1043 21.2.3 M ed iato rs 1046 21.2.4 Exercises for Section 2 1 2 1048 21.3 Wrappers in Mediator-Based Systems 1049 21.3.1 Templates for Query P a tte rn s 1050 21.3.2 Wrapper G e n e ra to rs ... 1008 20.5.1 Supporting Distributed Atomicity 1008 20.5.2 Two-Phase C o m m it .1009 20.5.3 Recovery of Distributed Transactions 1011 20.5.4 Exercises for Section 2 0 5 1013 20.6 Distributed L o c k in g 1014 20.6.1 Centralized Lock S y s te m s 1015 20.6.2 A Cost Model for Distributed Locking Algorithms 1015 20.6.3 Locking Replicated E le m e n ts 1016 20.6.4... 726 15.4.4 A Sort-Based Union A lg o rith m 726 15.4.5 Sort-Based Intersection and D ifference 727 15.4.6 A Simple Sort-Based Join A lgorithm 728 15.4.7 Analysis of Simple Sort-Join .729 15.4.8 A More Efficient Sort-Based J o i n 729 15.4.9 Summary of Sort-Based A lg o rith m s 730 15.4.10Exercises for Section 1 5 4 730 Two-Pass Algorithms Based on H a sh in g ... 21.4 Capability-Based O p tim iz atio n 1056 21.4.1 The Problem of Limited Source C apabilities 1056 21.4.2 A Notation for Describing Source C apabilities 1057 21.4.3 Capability-Based Query-Plan Selection 1058 21.4.4 Adding Cost-Based O ptim ization .1060 21.4.5 Exercises for Section 2 1 4 1060 21.5 Optimizing Mediator Q u e rie s 1061 21.5.1 Simplified Adornment N o... Chapter 1 0 480 III Modeling and Programming for Semistructured Data 481 11 T h e S e m is tru c tu re d -D a ta M o d el 483 11.1 Semistructured D a t a 483 11.1.1 Motivation for the Semistructured-Data M o d e l 483 11.1.2 Semistructured Data R ep resentation 484 11.1.3 Information Integration Via Semistructured D a ta .486 11.1.4 Exercises for Section 1 1 1 487 11.2 X .