Contents

B461: Advanced Database Concepts

Fall 2009

Assumed Background Knowledge

Mathematics & Logic

• Basic Algebra
• Discrete Mathematics. In particular, recursion, mathematical and structural induction, set theory, and logic (propositional and predicate). References:

  Ken Rosen, Discrete Mathematics and its Applications (McGraw Hill 2003).

Computer Science

• Experience with procedural programming in a language such as Java, C, C++, or JavaScript.
• File system layout and management (both UNIX and Windows).
• Data Structures and algorithm design and analysis, especially O-notation ("big-oh" notation). References:

  	Ken Rosen, Discrete Mathematics and its Applications (McGraw Hill 2003).
  	Paul Purdom and Cynthia Brown, Analysis of Algorithms (Thompson 1997).
  	Cormen, Leiserson, and Rivest, Introduction to Algorithms (MIT Press 2001).

Useful Other Knowledge

• LaTeX references:

  	L. Lamport. LaTeX: A Document Preparation System User's Guide and Reference Manual. (Addison-Wesley, 1994.)
  	Goosens, Mittelback & Samarin. The LaTeX Companion (Addison-Wesley, 1994.)

• Xfig, etc: see the UNIX man pages.