Lecture9 - ECS 165B: Database System Implementation Lecture...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECS 165B: Database System Implementation Lecture 9 UC Davis April 16, 2010 Announcements Several reminders: 1. DavisDB Part 1 due Sunday at 11:59pm 2. Dont forget about the writeup ( writeup.txt ) when submitting your code 3. Comment your code (but dont go overboard) 4. Style counts! Keep your code clean, simple, readable . . . 5. Late policy (as per course web page): I 5% penalty per hour late; no credit after 20 hours I But, 48 free late hours for entire course Well have code review meetings next week (stay tuned for email) DavisDB Part 2 (Index Manager) will be handed out Monday; due Sunday, 5/2 at 11:59pm Agenda I Last time - A taste of database theory, Part 1: relational algebra, relational calculus, and first-order logic I Today - A taste of database theory, Part 2: containment and equivalence of conjunctive queries I Reading: none Recall from last time: relational calculus (RC) I Database query language based on first-order logic I Syntax: expressions of the form { ( x 1 ,..., x n ) | ( x 1 ,..., x n ) } where ( x 1 ,..., x n ) is a first-order formula with free variables x 1 ,..., x n . I Semantics: return all tuples ( a 1 ,..., a n ) such that ( a 1 ,..., a n ) is true in the database. Example: relational calculus queries Database with three relations: Class (classId, className, roomNo); Student (studentId, studentName); and Takes (studentId, classId). I Find all students taking a class meeting in Wellman 1 { ( x ) | s c n Student ( s , x ) Takes ( s , c ) Class ( c , n , Wellman 1) } I Find all pairs of students not taking a class together { ( x , y ) | s...
View Full Document

Page1 / 20

Lecture9 - ECS 165B: Database System Implementation Lecture...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online