CS44800, Spring 2019

Home Syllabus Schedule Homeworks, Projects, & Handouts Readings

Homework, Projects & Handouts

Update (2/13/2019):
From now on, homeworks will be submitted online via Blackboard

Homework 1 Due on 01/23/2019 before class. [Feedback]
Homework 2 Due on 02/11/2019 before class. [Feedback]
Homework 3 Due on 03/04/2019 11:59 pm. [Feedback]
Homework 4 Due on 04/09/2019 11:59 pm. [Feedback]
Homework 5 Due on 04/19/2019 11:59 pm. [Feedback]

Project 1: Disk vs In-Memory vs Database. Due on 01/21/2019 11:59 pm [Feedback]

The goal for the project is to create a simple database application that supports query operation over a relation. The project consists in three parts. In each part you are asked to implement the backend of the application in a different way (filesystem, in-memory data structures and a embedded database).

[handout] [files]

Practice Project: SQL. No Grade

The goal of this practice project to give you the opportunity to experience with SQL. If you have not taken CS 34800 this project will help you to make comfortable writing SQL and programming scripts/applications that access databases. In case, you have taken CS 34800, the project will help you to practice the concepts already learned in that course. In both cases, we encourage you to complete this project. The project is divided in three parts (that will be covered during the PSO sessions during February): (a) SQL; (b) PL/SQL; (c) JDBC.

[handout] [files] [Solution] [SQL Tutorial]

Project 2: Buffer Manager. Due on 02/25/2019 11:59 pm

The goal of this project is to implement a simplified version of a Buffer Manager layer, without support of concurrency control or recovery. This project is based on Minibase, a small relational DBMS, structured in several layers.

[handout] [files]

Project 3: Relational Operators Due on 04/01/2019 11:59 pm

The goal of this project is to implement Relational Algebra Operators using the Iterator interface inside a working database system. This project is based on Minibase, a small relational DBMS, structured in several layers.

[handout] [files] [slides]

Project 4: Hadoop/Spark Due on 04/22/2019 11:59 pm

The goal of this project is getting some experience in Big Data Technologies. For the project, you will use Hadoop Distributed Filesystem and Spark to perform some data processing tasks. We encourage you to start as soon as possible with this project, especially since you need to become familiar with the Purdue Scholar Cluster. Related material will be covered during the PSO sessions of April.

[handout] [files]

Practice Project: Concurrency Control and Recovery. No Grade

The goal of this project is to implement a simplified version of the 2PL protocol used to handle concurrent operations (e.g., transactions). The implementation should prevent deadlocks and handling them properly. Even though the project is non-graded, we encourage you to complete it, to get some practical experience about Chapter 20 (Intro to Transaction Processing Concepts and Theory), 21 (Concurrency Control Techniques) and 22 (Database Recovery Techniques) from the Textbook. The project will be covered during the PSO sessions in April. No solution will be posted online.

[handout] [files]

Other Handouts

Operating System Support for Database Management, Michael Stonebraker, Communications of the ACM, Volume 24 Issue 7, Pages 412-418, July 1981. (pdf)
The Raid Distributed Database System, Bharat Bhargava and John Riedl, IEEE Trans on Software Engineering, 15(6), June 1989. (pdf)
The design and implementation of INGRES. Michael Stonebraker,ACM Transactions on Database Systems (TODS) 1.3 (1976): 189-222. (pdf)

2PL and Conflict Graph. (pdf)
Locking-Serializability. (pdf)
Optimistic-timestamps-Failure-Commitment. (pdf)
It will help you learn about CC ideas on 2PL, optimistic, time stamps and about transaction failures to help you do the homework.
You may read the papers on CC under handouts and check sections 2 up to 2.3.2. (pdf)
You may read slides on chapter 21 (7th edition) up to slides 21-22 and then 27-29 for answers to homework. (pdf)
Logs, failures, serializability is discussed in slides for chapter 20. (pdf)
Concurrency Control in Database Systems, Bharat Bhargava, IEEE Trans on Knowledge and Data Engineering,11(1), Jan.-Feb. 1999. (pdf)
The Transaction Concept: Virtues and Limitations , Jim Gray, VLDB, 1981. (pdf)

Hey, You, Get Off of My Cloud, T. Ristenpart, E. Tromer, H. Shacham, S. Savage.in Proceedings of CCS 2009, pages 199-212. ACM Press, Nov. 2009. (pdf)
Amazon's response to "Hey, you, get off my cloud". (pdf)
Above the Clouds: A Berkeley View of Cloud Computing (pdf)

Design of intelligent query systems for large databases, Bharat Bhargava, in Lecture notes in Computer Science 2005 (pdf)
ExpoDB: An Exploratory Data Science Platform, Mohammad Sadoghi, CIDR, 2017. (pdf)

NoSQL vs Relational Databases
Relational Database Management System (RDBMS) vs NoSQL
RDBMS vs NoSQL: How do you pick?
Big Data Means at Least Three Different Things by Michael Stonebraker (slides)

Relational Algebra - Tree Optimizations (pdf)
VLSI for Relational Algebra. Kung, H. T., and Philip L. Lehman.Proceedings of the 1980 ACM SIGMOD international conference on Management of data. ACM, 1980. (pdf)
Example of proving loss less join (pdf)
Handout on Natural and Outer Joins & Relational Calculus (pdf)
Engineering the Object-Relation Database Model in O-Raid (pdf)
Normalization and lossless joins and FD preservations (pdf)
SQL Questions & Answers (pdf)
SQL Tutorial Questions and Answers
PL/SQL Tutorial code
JDBC Tutorial code
Oracle certification exam (sample questions)

Notes

Solid State Drive (SDD)
How Solid State Drive (SDD) works
Data Science and Prediction (pdf)
Private and Trusted Interactions (slides)
Handout on SAP Software (pdf)
SAP online training (video)

CS44800: Introduction to Database Systems, Spring 2019