CSE 707: Seminar on Modern Database Systems (Fall 2021)

Modern database systems have different designs compared to traditional RDBMS in many aspects. In this seminar, we will review and discuss a range of papers of modern database system designs. The topics will include query processing, transaction processing, indexing and storage, and etc.
Prerequisites: CSE 462/562 Database Systems or equivalents.

Logistics

Link to syllabus.
Location and Time: Davis Hall 338A, Wednesday 10:25 am to 12:30 pm.
Instructor: Zhuoyue Zhao, zzhao35 [at] buffalo [dot] edu, Davis Hall 338I.
Office hours are on demand. Email me for an appointment.
No required textbook.
Optional readings: Readings in Database Systems, 5th Edition, by Peter Bailis, Joseph M. Heller- stein, and Michael Stonebraker. Available online.
Attendance is highly encouraged but let me know if you are going to miss one.
Sign up for your presentation here by Thursday, 9/2, midnight.
We'll be using Piazza for discussion, Q&A and paper summary submissions. Find our class page here. To submit an assignment, post a note only visible to the instructor in Piazza under the assignment folder for that week, with an attachment in PDF format.

Course Requirements

• Do the required reading before each lecture.
• Write a short summary (at most 1 page) of the paper presented in the lecture. It should briefly summarize the problem solved, the assumptions made if any, the technical contribution, the trade-offs made and/or possible alternative approaches. The summary is due one day before the next lecture (every Tuesday 11:59 pm). No late submission will be accepted.
• Present one of the selected papers throughout the semester. You're encouraged but not required to post your slides before the presentation, but please share it after your talk by posting a private note to me after your talk. I'll post a link to your slides on the course website. The presentation should be about 30 - 50 min, or 20 - 40 slides in length, and should give a brief introduction to the background, the problem solved, the solution, as well as a comparison to the baseline (and experiments if available). There will be Q&A and discussion after your talk.

Grading

• 70% for the short summaries (5% each). You may skip the summary for the paper you present with no penalty.
• 30% for the presentation.

Tentative assignment of grades: Satisfactory for score >= 75% and unsatisfactory for score < 75%.

Course Schedule

Date	Presenter	Topic	Readings	Slides
9/1/2021	Zhuoyue	Introduction	Michael Stonebraker, Ugur Cetintemel. "One Size Fits All": An Idea Whose Time Has Come and Gone. In ICDE '05.
9/8/2021	Zhuoyue	Data cube	Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman. Implementing Data Cubes Efficiently. In SIGMOD '96. (Optional) Yihong Zhao, Prasad M. Deshpande, Jeffrey F. Naughton. An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. In SIGMOD '97.
9/15/2021	Songtao Wei	Columnar store	Michael Stonebraker, et al. C-store: a column-oriented DBMS. In VLDB '05. (Optional) Andrew Lamb, et al. The Vertica Analytic Database: CStore 7 Years Later. In VLDB '12.
9/22/2021	Saurabh Wanivadekar	SIMD	Orestis Polychroniou, et al. Rethinking SIMD Vectorization for In-Memory Databases. In SIGMOD '15.
9/29/2021	Nitin Vinod	Query compilation	Thomas Neumann. Efficiently Compiling Efficient Query Plans for Modern Hardware. In VLDB '11.
10/6/2021	Gowtham Rajasekaran	Online Aggregation	Feifei Li, et al. Wander Join: Online Aggregation via Random Walk. In SIGMOD '16. (Optional) Christopher Jermaine, et al. Scalable Approximate Query Processing with the DBO Engine. In SIGMOD '07.
10/13/2021	Surya Muthiah Pillai	Approximate Query Processing	Srikanth Kandula, et al. Quickr: Lazily Approximating Complex AdHoc Queries in BigData Clusters. In SIGMOD '16. (Optional) Sameer Agarwal, et al. BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data. In Eurosys '13.
10/20/2021	Zhuoyue	Persistent sketches	Benwei Shi, et al. At-the-time and Back-in-time Persistent Sketches. In SIGMOD '21. (Optional) Zhewei Wei, et al. Persistent Data Sketching. In SIGMOD '15.
10/27/2021	Krishnakumar Chandrasekaran	Concurrency control	Thomas Neumann, et al. Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems. In SIGMOD '15. (Optional) Dan R. K. Ports, Kevin Grittner. Serializable Snapshot Isolation in PostgreSQL. In VLDB '12.
11/3/2021	Akshaya Mohan	Shared-nothing database	Michael Stonebraker, et al. The End of An Architectural Era (It's Time for a Complete Rewrite). In VLDB '07.
11/10/2021	Amneet Kaur	Shared-everything database	Simon Loesing, et al. On the Design and Scalability of Distributed Shared-Data Databases. In SIGMOD '15.
11/17/2021	Zhuoyue	Main-memory database	Xiangyao Yu, et al. Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores. In VLDB '15.
11/24/2021	Fall recess, no lecture today.
12/1/2021	Isha Narula	Lock-free index	Justin Levandoski, et al. The Bw-Tree: A B-tree for New Hardware Platforms . In ICDE '13. (Optional) Joy Arulraj, et al. BzTree: A High-Performance Latch-Free Range Index For Non-Volatile Memory. In VLDB '18.
12/8/2021	Chaitanya Uppuluri	High availability	James C. Corbett, et al. Spanner: Google's Globally-Distributed Database . In OSDI '12. (Optional) Giuseppe Decandia, et al. Dynamo: Amazon's Highly Available Key-value Store. In SOSP '07.

Academic Integrity

Students may discuss the papers before writing the summaries, but not what specific contents to write in the summaries. Students are expected to write the summaries independently, based on papers, presentation and/or discussion. Simply paraphrasing others' work is treated plagiarism and any plagiarism will result in an F grade. The slides for the paper presentation may be based on existing works of others (e.g., the conference talk slides from the paper authors), as long as there are proper citations and acknowledgments. Departmental and university policies on academic integrity may be found at here.