• Slides: Intro1, Intro2, Chp7: internet application, Notes on ASP.NET, Chp2: ER Diagram, Chp3: Relational Model, Chp19: Normal Forms, Chp4: Relational Algebra, Chp5: SQL, NEUStore, Query Evaluation, Chp8&9: Storage, Chp10: B+-tree, Hash Index, Ch17: concurency control,
• Jian Wen, one of the TAs, has changed his office hour to W 3-6pm.
• Project rubric and deadlines are here. Submit project 1 to Jian Wen by Nov 15. Submit project 2 to Tianhua Zheng by Nov 29.
• If you have not received any email announcement from me, send me an email. Most probably I sent to your NEU email account which you do not check often.
• Room change: lecture place has been changed from 309 Kariotis to 300 Richards Hall.
• Quiz 1 preparation questions: 2.1, 2.2, 2.7, 3.1, 3.4, 3.6, 3.17, 19.1, 19.2, 19.8.
• Grade Sheet.
• Quiz 2 preparation: solve all the queries we discussed in lecture, in both RA and SQL.
• No class on Nov 8.
• Quiz 3 preparation:
  • Explain the meaning of seek time, rotational delay, and transfer time.
  • Explain the difference between primary index and secondary index.
  • Suppose every disk page has the same size. A BufferManager class manages a buffer for disk pages and has two public methods "readPage" and "writePage". Both these methods take as input a pagenumber. Here "readPage" returns a disk page to the application, and "writePage" keeps note that the application has modified a page. Write an informal algorithm for each of these methods. You can use sentences such as "pick a frame in buffer for replacement", "mark the page as dirty", and "write the page to disk".
  • Start with an initially empty LRU buffer, given a set of "readPage" and "writePage" requests, mark the buffer content and actual disk read/write operations after servicing each request. For example, let the buffer capacity be four pages, and let the list of requests be readPage(1), readPage(3), readPage(4), writePage(4), writePage(5), writePage(3), writePage(6), readPage(1), readPage(6).
  • Given a B+-tree, draw the layout after applying an insertion or deletion. Tell what pages need to be accessed to service an exact-match, range search, or insertion. Use the B+-trees on slides as examples.
  • The LRU and B+-tree problems can be combined. For instance, on page 21 of the B+-tree slides, there is a "buffering" exercise on B+-tree. Suppose an intially empty LRU-buffer is used which holds up to four pages. Derive the list of readPage and writePage requests from applying the B+-tree search and insert operations, and then for each operation decide the buffer content and actual disk read/write operations.
  • Do the Extendible Hashing exercise on page 23 of the Hashing slides.

Instructor

Office Hours: M Th 4-5:30pm.
Office: 478WVH
Phone: x2177
Email: donghui AT ccs.neu.edu

Lecture: Thursday 6-9pm. 300RI.

TA

Overview

Grading

• Quizzes: 30%
• Project 1: 20%
• Project 2: 10%
• Final 40%

Textbook

Presentation

Projects

Some information
• There are two projects.
• You can either do the projects alone, or be part of a group of no more than three people. Doing the project alone will not be weighted more in grading. In any group, every group member will receive exactly the same project score regardless of how much contribution each individual has.
• The project should be submitted to the TA (not me).
• Advice: start doing the project early!

Project 1
• Develop a non-trivial web-database application, which will be demonstrated in class.
• You can choose (a) DBMS (b) programming language (c) project.
• Requirements: (a) use some DBMS (b) can demonstrate in class (c) search + update + bulkload (d) on time.
• Sample projects: (a) CCIS Faculty Listing (b) Skyline Computation
• Provided environment: ASP.NET.

Project 2
• Develop a simple database system. The project description is here.
• Helpful materials for the project are: the NEUStore package and the multithreaded socket programming page.
• The programs should be well documented in the javadoc format. The PDF file should explain additional information, including how to run your programs and meaningful results of your runs (at your discretion).

Tentative Schedule

Academic Honesty