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.
Lectures (Tentative)
|
SCHEDULE OF CLASSES
|
|
Date |
Topic |
|
XX/XX/2009
|
Introduction and overview |
|
XX/XX/2009
|
ER
Relational data model |
|
XX/XX/2009
|
Extended ER |
|
XX/XX/2009
|
SQL |
|
XX/XX/2009 |
OO
and OR-DBMS |
|
XX/XX/2009
|
Spatial Databases ,Spatial
Index |
|
XX/XX/2009
|
Database Application Development |
|
10/14/2009
|
Exam 1 |
|
XX/XX/2009
|
XML |
|
XX/XX/2009
|
Distributed Databases
|
|
XX/XX/2009
|
Multidimensional Databases |
|
XX/XX/2009
|
Exam 2 review |
|
12/02/2009
|
Exam 2
|
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:
- Jim Gray. "Evolution of Data Management." Computer
v29 n10 (October 1996):38-46.
- Michael Stonebraker. "Object-Relational DBMS-The
Next Wave." Informix white paper
- Thomas Connolly, Carolyn Begg, and Anne Strachan.
"Ch 17: Object Databases." Database Systems.
- Zhen Hua Liu. "Object-Relational Features in
Informix Internet Foundation." Informix technical notes.
9.4(Q4 1999):77-95.
- Alin Deutsch et. al. "Querying XML Data" Bulletin of
Data Engineering, v22, n3, Sep. 1999
- Ralf Hartmut Guting. "An Introduction to Spatial
Database Systems." VLDB Journal 3(4): 357-399, 1994.
- Dimitris Papadias, Yannis Theodoridis, Timos K.
Sellis and Max J. Egenhofer. "Topological Relations in
the World of Minimum Bounding Rectangles: A Study with
R-trees." Proceedings of SIGMOD, pp.92-103, 1995.
- Patrick O'Neil and Elizabeth O'Neil. "Ch 4:
Object-Relational SQL." Database Principles, Programming
and Performance, 2nd edition, Morgan Kauffman
publications.
- 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.
- 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.
- XML 1.0 (http://www.w3.org/TR/REC-xml)
- XML-QL: A Query Language for XML (http://www.w3.org/TR/NOTE-xml-ql/)
- S. S. Chawathe "Describing and Manipulating XML
Data" Bulletin of Data Engineering, v22, n3, Sep. 1999
- Ching-Tien Ho Rakesh Agrawal Nimrod Megiddo
Ramakrishnan Srikant "Range Queries in OLAP Data Cubes"
(1997) . SIGMOD 1997
- S. Geffner D. Agrawal A. El Abbadi "The Dynamic Data
Cube" . EDBT'2000
- Mirek Riedewald, Divyakant Agrawal, and Amr El
Abbadi "Flexible Data Cubes for Online Aggregation" .
ICDT'2001
- J. S. Vitter, M. Wang, and B. Iyer. "Data Cube
Approximation and Histograms via Wavelets" . CIKM'1999
- Torben Bach Pedersen, Christian S. Jensen.
"Multidimensional Database Technology", IEEE Computer
Dec. 2001.
- Surajit Chaudhuri, Umeshwar Dayal, Venkatesh Ganti.
"Database Technology for Decision Support Systems", IEEE
Computer Dec. 2001.
- 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 2002
- 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, 2002
- (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 )
-
An Introduction to Spatial Database Systems
Related Web Sites
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.
|
|