|
EECS-6421A:
Advanced Database Systems
York University
Fall 2017
|
Class Homepage
|
|
|
Instructor:
|
Parke Godfrey
|
Office:
|
#2050 Lassonde
|
Office Hours:
|
Th 3–5pm
|
& by appointment / availability
|
Ph#:
|
416-736-2100 x66671
|
e-mail:
|
godfrey@yorku.ca
|
|
|
|
Term:
|
fall 2017
|
Time:
|
Mo & We 4:00pm–5:30pm
|
Place:
|
BC #228
|
|
|
|
|
Welcome
to
EECS-6421A,
Advanced Database Systems,
for fall term 2017.
Materials, instructions, and notices
for the course will accumulate here over the semester.
|
|
|
|
Course
notices will accumulate here over the term.
Be certain to check here regularly.
Refresh this page via your browser
when you visit to ensure that you are not looking at an old, cached copy.
Otherwise, you can miss the latest message.
|
|
Exam (PDF)
is up.
Due by 11:59pm Friday 15 December 2017.
Assignment #4, TFIDF,
on MapReduce
is posted.
Due Monday 4 December 2017.
Readings F & G
on NoSQL
are up.
Readings D & E
on query optimization
are up.
Assignment #3 (PDF)
is posted.
Due Wednesday 8 November 2017.
2017-10-11:
Reading C posted,
Bridging the Gap between OLAP and SQL.
(We won't manage to be as aggressive with readings
as I originally intended, as marked in the initial
schedule.)
Assignment #2,
Querying the StL Database,
is posted.
Due Wednesday 25 October 2017.
For Assignment #1,
turn it in by e-mail in PDF format.
- to: Parke Godfrey <godfrey@yorku.ca>
- Subject: EECS-6421 Assignment #1
Or hardcopy by hand.
(If you must!)
Readings A & B are up.
Check the schedule.
Assignment #1 PDF
is posted.
Due Wednesday 4 October 2017.
The first class is Monday 11 September.
Welcome!
|
|
|
|
|
Lecture Notes
- Introduction
- Logic
- semantics
- logic primer & datalog (36 pages):
PDF,
PDF (2-per)
- prolog diversion (14 pages):
PDF,
PDF (2-per)
- datalog w/ negation (9 pages):
PDF,
PDF (2-per)
- well-founded & stable model semantics (8 pages):
PDF,
PDF (2-per)
- query languages:
- datalog examples: ...
- relational algebra & calculus
- relational algebra [chapter 3]*:
PDF
- miscellaneous exercises:
PDF,
PDF (w/ answers)
See #14 & #15 for relational algebra
and calculus examples, respectively.
- SQL
- the relational model [chapter 3]*,
for review (34 pages):
PDF,
PDF (2-per)
Includes basic constraints,
DDL / data definition language
(e.g., create table),
& DML / data manipulation language
(e.g., insert).
- queries, constraints, & triggers [chapter 5]*
(35 pages):
PDF,
PDF (2-per)
- SQL examples:
PDF,
PDF (2-per)
- System
- RDBMS architecture chart (1 page):
PDF
- the physical database
- overview of storage & indexes [chapter 8]* (32 pages):
PDF,
PDF (2-per)
- storing data: disks and files [chapter 9]* (29 pages):
PDF,
PDF (2-per)
- tree-structured indexing [chapter 10]* (26 pages):
PDF,
PDF (2-per)
- hash-based indexing [chapter 10]* (19 pages):
PDF,
PDF (2-per)
- query optimization
- external sort [chapter 13]* (19 pages):
PDF
- evaluation of joins [chapter 14-A]* (16 pages):
PDF
- evaluation of other operators [chapter 14-B]* (11 pages):
PDF
- the query optimizer (System-R) [chapter 15]* (19 pages):
PDF
- query planning class examples (4 pages):
PDF
&
sketch-through (PDF)
- Beyond Relational (“NoSQL”)
-
NoSQL
-
Variety: NoSQL
- XML & XQuery:
examples
- Graph Databases:
RDF & SPARQL
- scaling out
- Directions
- information integration
- data visualization
- student topics
*Derived from the textbook slides by Ramakrishnan and Gehrke.
|
|
Readings
(You have to authenticate to reach here.
This is to respect copyright on materials.)
|
|
References
- peggly:
A prolog implementation of the game of peggly.
This also provides code to trace and print the proof tree.
- DB2 and SQL:
|
|
|
|
- Assignments
- Assignment #1: PDF
Due Wednesday 4 October 2017.
- Assignment #2:
Querying the StL Database.
Due Wednesday 25 October 2017.
- Assignment #3:
PDF
Due Wednesday 8 November 2017.
- Assignment #4:
TFIDF
(Worth 10%;
counts for A-4 & A-5 in course outline.)
Due Monday 4 December 2017.
- Presentations
- Reports
- Exam
- PDF
Due by 11:59pm Friday 15 December 2017.
Deliver to my mailbox in Lassonde #1012,
to me in person,
or scan and email to me.
(If you need more time,
arrange with me.)
|
|
|
|
|