[USC / University of Southern California]CSCI585: Database Systems

[Course Summary | Required Materials | Lectures | Assignments | Academic Integrity Policy | Related Web Sites | Prerequisites | Announcements ]



Monday and Friday 2:00-3:20 PM
Location: OHE-122 
 

People

Instructor

Dr. Farnoush Banaei-Kashani

      Office: PHE 330
      Phone:  (213) 821-0876
      Email:  banaeika AT usc.edu
      Office Hours: TBD
 

Teaching Assistants

Ugur Demiryurek

      Office: SAL 209
      Phone:  (213) 740-4513
      Email:  csci585s AT usc.edu
      Office Hours: TBD

 

Graders

TBD

 

Course Summary

This course covers the essential concepts, principles, techniques, and mechanisms for the design, analysis, use, and implementation of computerized database systems. Key information management concepts and techniques are examined: information modeling and representation; information interfaces - access, query, and manipulation, implementation structures, and issues of distribution. The database and information management system technology examined in this course represents the state-of-the-art, including traditional approaches as well as recent research developments. By providing an imbalanced view of "theory" and "practice," the course should allow the student to understand, use, and build practical database and information management systems. The course is intended to provide a basic understanding of the issues and problems involved in database systems, a knowledge of currently practical techniques for satisfying the needs of such a system, and an indication of the current research approaches that are likely to provide a basis for tomorrow's solutions.
Back to top


Announcements

 
Back to top


D-Clearance

You can go to SAL-300 and obtain D-clearance for csci585 (regardless of your major (CS, EE, ...) and/or status (MS, PhD)). If the class is full, then add your name to the waiting list and show up during the first couple of sessions.
Back to top


PreRequisites

As stated in the university catalog, a passing grade in CSCI485 or departmental permission is required to register for this class. Knowledge in relational databases, SQL, relational algebra and physical database design is required.

This Course involves challenging programming assignments and projects for which understanding of and programming ability in Java is required. Knowledge in JDBC is a plus.
Back to top


 

Required Materials

The following textbook and additional readings will be used this semester to augment the material presented in the lectures:

Textbook :
   Ramakrishnan, Gehrke. "DATABASE MANAGEMENT SYSTEMS" , third edition, McGRAW Hill

Additional readings (A.R.):

1.      Jim Gray. "Evolution of Data Management." Computer v29 n10 (October 1996):38-46.

2.   Michael Stonebraker. "Object-Relational DBMS-The Next Wave." Informix white paper.

3.      Thomas Connolly, Carolyn Begg, and Anne Strachan. "Ch 17: Object Databases." Database Systems.

4.      Oracle Documentations. "Application Developer's Guide - Object-Relational Features" .

5.      Alin Dtsch et. al. "Querying XML Data" Bulletin of Data Engineering, v22, n3, Sep. 1999

6.      Ralf Hartmut Guting. "An Introduction to Spatial Database Systems." VLDB Journal 3(4): 357-399, 1994.

7.      Antomn Guttman. "R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING." Proceedings of ACM SIGMOD, pp.47-57, 1984.

8.      Shahram Ghandeharizadeh and Cyrus Shahabi. "Distributed Multimedia Systems." Wiley Encyclopedia of Electrical and Electronics Engineering, volume 5, pp720-750.

9.      Patrick O'Neil and Elizabeth O'Neil. "Ch 4: Object-Relational SQL." Database Principles, Programming and Performance, 2nd edition, Morgan Kauffman publications.

10. Cyrus Shahabi, Roger Zimmermann, Kun Fu, and Shu-Yuen Didi Yao, "Yima: A Second Generation of Continuous Media Servers", IEEE Computer Magazine, Vol.35, No.6, Pages 56-64, June 2002

11.  Hanan Samet. "Spatial Data Structures." Appears in Modern Database Systems: The Object Model, Interoperability, and Beyond, W.Kim, ed., Addison Wesley/ACM Press, Reading, MA, 1995, 361-385.

12.  Timos Sellis, Nick Roussopoulos and Chrishtos Faloutsos. "THE R+-TREE: A DYNAMIC INDEX FOR MULTI-DIMENSIONAL OBJECTS." Proceedings of the 13th VLDB Conference, Brighton 1987.

13.  XML 1.0 (http://www.w3.org/TR/REC-xml)

14.  XQuery 1.0: An XML Query Language ( http://www.w3.org/TR/NOTE-xml-ql/)

15.  S. S. Chawathe "Describing and Manipulating XML Data" Bulletin of Data Engineering, v22, n3, Sep. 1999

16.  Ching-Tien Ho Rakesh Agrawal Nimrod Megiddo Ramakrishnan Srikant "Range Queries in OLAP Data Cubes" (1997) . SIGMOD 1997

17.  S. Geffner D. Agrawal A. El Abbadi "The Dynamic Data Cube" . EDBT'2000

18.  Mirek Riedewald, Divyakant Agrawal, and Amr El Abbadi "Flexible Data Cubes for Online Aggregation" . ICDT'2001

19.  J. S. Vitter, M. Wang, and B. Iyer. "Data Cube Approximation and Histograms via Wavelets" . CIKM'1999

20.Torben Bach Pedersen, Christian S. Jensen. "Multidimensional Database Technology", IEEE Computer Dec. 2001.

21.  Surajit Chaudhuri, Umeshwar Dayal, Venkatesh Ganti. "Database Technology for Decision Support Systems", IEEE Computer Dec. 2001.

22.Rolfe R. Schmidt and Cyrus Shahabi, ProPolyne: A Fast Wavelet-based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries (extended version), VIII. Conference on Extending Database Technology, Prague, March 2004

23.Rolfe R. Schmidt and Cyrus Shahabi, How to Evaluate Multiple Range-Sum Queries Progressively, 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Madison, Wisconsin, June, 2004

24.(M. Riedewald, D. Agrawal, A. El Abbadi, and R. Pajarola. Space-Efficient Data Cubes for Dynamic Environments. In Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK), pages 24-33, 2000 )

25. Storing a Collection of Polygons Using Quadtrees. Hanan Samet, Rober E. Webber.  ACM Transactions on Graphics (TOG) ,pages 182-222, 1995.

26. Apache Xindice

27. Application Programming Interface for XML Databases

28. Streaming Media Server Design

29. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. "The R*-Tree: An efficient and robust access method for points and rectangles", SIGMOD 1990.

 

 

Java References :

1.      Sun Java Tutorial (http://java.sun.com/docs/books/tutorial/)

2.      Beginning Java 2 SDK 1.4 Edition (http://www.wrox.com/WileyCDA/WroxTitle/productCd-0764543652.html)

3.      Core Java 2, Volume I, by Gary Cornell, Cay S. Horstmann.

 

Oracle References:

1.      Oracle SQL Quick Reference

2.      Oracle SQL Reference

3.   Oracle SQL*Plus User's Guide and Reference 

4.   Oracle Application Developer's Guide - OR Features

5.   Oracle Spatial User's Guide and Reference

6.   Oracle Spatial Java API Reference (you need to register at oracle.com)

7.   Online Oracle Documentations

 

 

 

In principle, these readings also will be available for download from the DEN.

The material covered in lectures should be considered the main definition of the scope of the course. However, the text and readings are important to supplement lecture material. Assignments and exams will be based on the topics presented in lecture, and may also involve issues addressed in the textbook and readings.
Back to top


Lectures

(A.R. refers to Additional Readings)

SCHEDULE OF CLASSES

Date

Topic

Handouts

01/14/2008

Introduction and overview (A.R. 1

The Pre-Requisite Disclaimer Form

01/18/2008

Introduction and overview 

01/21/2008

No Class--Martin Luther King Day

01/25/2008

ER data model (review) 

01/28/2008

Relational data model (review)  

 

02/01/2008

Extended ER 

02/04/2008

SQL (review) 

 

02/08/2008

SQL (advanced)

 

02/11/2008

SQL (advanced)

OO and OR-DBMS  (A.R. 3 , 2, 9)

02/15/2008

Oracle 10g ORDBMS and SQL3 (A.R. 4)

02/18/2008

No Class--President's Day 

02/22/2008

 Database Connectivity

02/25/2008

Spatial Databases (A.R. 6

 

02/29/2008

Spatial Databases

03/03/2008

Spatial Index Structures (A.R. 7, 11 , 12, 25, 29)  

03/07/2008

Spatial Index Structures 

 

03/10/2008

Exam 1 review  

03/14/2008

Exam 1

03/17/2008

No class--Spring Break 

  

03/21/2008

No class--Spring Break 

  

03/24/2008

Exam 1 discussion

 

03/28/2008

XML (A.R. 13,15, A.R. 5, XQuery 1.0,XQuery Update

 

03/31/2008

XML

04/04/2008

Multidimensional Databases (A.R. 16, A.R. 20, A.R. 21)

04/07/2008

OLAP (A.R. 17)

04/11/2008

OLAP (A.R. 18, A.R. 24)

04/14/2008

OLAP(A.R. 19, 22, 23)

04/18/2008

Distributed Databases

 

04/21/2008

Distributed Databases

 

04/25/2008

Distributed Databases

04/28/2008

Exam 2 review

 

05/02/2008

Exam 2

  

 

Back to top


Exams and Assignments

There will be two exams in this course: a midterm and a second exam (not a final). Both exams will be given during scheduled class time. There will be three assignments. Remote login access is required for the assignments. Grading scheme:

GRADING POLICY

EXAM

WEIGHT

HOMEWORK 1

10%

HOMEWORK 2

15%

HOMEWORK 3

15%

EXAM 1

30%

EXAM 2

30%

Assignments Description

Homework 1

Use the Extended ER and Object Relational concepts to create a conceptual schema for a provided example application. Use your schema to build a sample database in Oracle. Write the given queries in SQL3 and execute them on your database.


Homework 2

Extend your schema of Homework 1 to support spatial datatypes. Use the new schema to build a database in Oracle. Write a GUI program that allow the users to select spatial attributes for spatial queries (e.g. selection from a map). The GUI must then parse these into SQL queries, which will be passed to your database.


Homework 3

Extend the schema from Homework 1 to XML. Create a DTD specification for the same. Write a custom XSL stylesheet (details will be provided). Write an XML parser module that reads the XML data and automatically populates your database (a sort of XML->SQL conversion). Write XML Queries using an XML Query Language (e.g., X-Query) to query the XML data.



Back to top


Academic Integrity Policy

Academic Integrity

All homework and exams must be solved and written independently, or you will be penalized for plagiarism. The USC Student Conduct Code prohibits plagiarism. All USC students are responsible for reading and following the Student Conduct Code, which appears on pp. 76-77 of the 2000-2001 SCampus.

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 SCampus.

Violations of the Student Conduct Code will be filed with the Office of Student Conduct, and appropriate sanctions will be given.
Back to top


Related Web Sites

·         USC Information Laboratory

·         USC Integrated Media Systems Center

·          Oracle Software

·         Stanford University Database Group

·         University of Wisconsin Database Group

·         University of Maryland Database Group

·         Excellent tutorial on XML, XSL,..

·         The Spatial Index Structures demo webpage

·         Download XML-QL

·         Download XMLSPY

·         Acrobat Reader

·         Ghostscript, Ghostview and GSview

·         Galax, an XQuery implementation

·         Database Management Systems by Raghu Ramakrishnan and Johannes Gehrke

 

Back to top