ON DATALOG

1) Read the entire Chapter 24 of the Cow Book. Exception: in Part
24.5.3 (The Magic Set Algorithm) you only have to scan the part
starting with "Adorned Program". That is, you need to know the basic
idea behind Magic Set algorithm. But I will not ask how you can
transform a datalog program into one with magic set.

2) Read the Datalog note by Jeff Ullman. You don't have to understand
the part on function symbols in rules deeply (but I recommend scanning
that part).

ON DATA INTEGRATION

1) Read Chapters 1-2 of the book draft. 

2) Read Chapter 3, up to and including 3.2.2. You must
understand the proof of Theorem 3.1. 

3) Read Sections 3.3 (Answering Queries using Views) up to and
including Section 3.3.3 (you do not have to read the proofs; the key
is to understand the basic concepts and ideas). Then read the minicon
algorithm in Section 3.3.4.  Again, you do not have to understand the
gory detail, only understand the basic working of the algorithm so
that you can apply minicon to relatively simple examples (such as
those discussed in the class).

4) Read Chapter 4, up to and including 4.2. 

5) Read the entire Chapter 5.