CSCI 585: Database Systems
Computer Science Department
University of Southern California
Spring 2009, TTH 15:30-16:50 (OHE 122)

Grading

Course Syllabus

  ·      Storage and Storage Management

• M. Seltzer. Beyond Relational Databases. Communications of the ACM, July 2008, Vol. 51, No. 7.

• D. A. Patterson, G. Gibson, and R. H. Katz. A Case for Redundant Arrays of Inexpensive Disks (RAID). ACM SIGMOD, 1988.

• G. Graefe. The five-minute rule twenty-years later, and how flash memory changes the rules. Proceedings of the Third International Workshop on Data Management on New Hardware (DaMoN), 2007.

  ·      Parallel DBMS

• D. DeWitt et al. The Gamma Database Machine Project. IEEE Transactions on Knowledge and Data Engineering, Vol. 2, 1990.
• F. Chang et al. Bigtable: A Distributed Storage System for Structured Data. In OSDI 2006.
• J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In Communications of the ACM, Vol. 51, No. 1, 2008.

  ·      Spatial Index Structures

• A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In ACM SIGMOD 1984.
• P. E. O’Neil, and D. Quass. Improved Query Performance with Variant Indexes. In ACM SIGMOD 1997.
   

  ·    Query optimizations

• P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, T. G. Price. Access Path Selection in Relational Database Management System. In ACM SIGMOD 1979.
• S. Chaudhuri. An Overview of Query Optimization in Relational Systems. PODS 1998.

  ·      Decision Support

• R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB 1994.
• J. Gray et al. Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab and SubTotals. Data Mining and Knowledge Discovery 1(1), 1997.
• C. Stolte, D. Tang, and P. Hanrahan. Polaris: A System for Query, Analysis, and Visualization of Multidimensional Databases. Communications of the ACM, Vol. 51, No. 11, November 2008.

  ·     Main Memory Databases

• P. A. Boncz, M. L. Kristen, and S. Manegold. Breaking the Memory Wall in MonetDB. Communications of the ACM, December 2008, Vol. 51, No. 12

  ·      Cache Management

• S. Ghandeharizadeh and S. Shayandeh. Greedy Cache Management Techniques for Mobile Devices. In First International IEEE Workshop on Ambient Intelligence, Media and Sensing. April 2007.
   

Academic Integrity Policy

All Assignments and projects must be solved and written independently, or you will be penalized for cheating. The USC Student Conduct Code prohibits plagiarism. All USC students are responsible for reading and following the Student Conduct Code.
In this course we encourage students to study together. This includes discussing general strategies to be used on individual assignments. However, all work submitted for the class is to be done individually.
Some examples of what is not allowed by the conduct code: copying all or part of someone else's work (by hand or by looking at others' files, either secretly or if shown), and submitting it as your own; giving another student in the class a copy of your assignment solution; consulting with another student during an exam. If you have questions about what is allowed, please discuss it with the instructor.
Students who violate University standards of academic integrity are subject to disciplinary sanctions, including failure in the course and suspension from the University. Since dishonesty in any form harms the individual, other students, and the University, policies on academic integrity will be strictly enforced. We expect you to familiarize yourself with the Academic Integrity guidelines found in the current USCampus.
Violations of the Student Conduct Code will be filed with the Office of Student Conduct, and appropriate sanctions will be given.