Data Management

CIS 616 – Spring 2005

 

syllabus

 

Week 1 (Jan 24, 2005):

canceled/postponed

Week 2: (Jan 31, 2005):

Lecture 2a: Inroduction to DBMS (Part 2)

Reading assignment: Chapter 1 from the textbook

Lecture 2b: Entity-Relationship Model

Reading assignment: Chapter 2 from the textbook

Homework 0

Week 3: (Feb 07, 2005):

Lecture 3: Relational Model

Reading assignment: Chapter 3 from the textbook

Homework 1: Solve the following problems from the textbook: 2.7, 2.6, 2.20, 3.3, 3.10 (assigned: Feb 07, 2005; due: in class, Mon, Feb 14, 2005)

Week 4: (Feb 14, 2005):

Lecture 4: Relational Databases: SQL, QBE

Reading assignment: Chapters 4, 5.1 from the textbook

Week 5: (Feb 21, 2005):

Lecture 5: Integrity and Security; Introduction to Relational Database Design

Reading assignment: Chapters 6, 7.1-7.4 from the textbook

Homework 2: Solve the following problems from the textbook: 4.2(a,d,e,i), 4.3(a,b,c,e), 4.8, 4.14, Write expressions in QBE only for 5.2(a,b,c,d) (assigned: Feb 21, 2005; due: in class, Mon, Feb 28, 2005)

Week 6: (Feb 28, 2005):

Canceled due to snow storm

NOTE: HW2 is due in class on Mar 14.

Week 7: (Mar 14, 2005):

Lecture 7: Relational Database Design

Reading assignment: Chapter 7 from the textbook

Homework 3: Solve the following problems from the textbook: 6.10, 6.10, 7.7, 7.12, 7.16, 7.24 (assigned: Mar 14, 2005; due: in class, Mon, Mar 21, 2005)

Week 8: (Mar 21, 2005):

Lecture 8: Storage and File Structure

Reading assignment: Chapter 11 from the textbook

SQL Server presentation (Nagesh)

ODBC presentation (Sumitha)

Week 9: (Mar 28, 2005):

MIDTERM

Lecture 9: Indexing and Hashing

Reading assignment: Chapter 12 from the textbook

Week 10: (Apr 04, 2005):

Lecture 10: Query Processing

Reading assignment: Chapter 13 from the textbook

NOTE: Course Project will be assigned during this week (you will be notified via e-mail)

Week 11: (Apr 11, 2005):

Lecture 11: Query Optimization

Reading assignment: Chapter 14 from the textbook (without 14.5)

Homework 4: Solve the following problems from the textbook: 11.12, 12.5 (BUT, consider the list in the descending order, use nodes with a) three, b) five pointers), 12.6, 12.12 (BUT, use the has function h(x) = x mod 6), 13.8, 14.5, 14.7 (assigned: Apr 11, 2005; due: in class, Mon, Apr 18, 2005)

Class Project

Week 12: (Apr 18, 2005):

Lecture 12: Transaction Management

Lecture 12plus: Concurrency Control

Reading assignment: Chapters 15, 16 (skip 16.1.4, 16.2.3, 16.4, 16.5, 16.7-9) from the textbook (without 14.5)

Class Presentation Instructions

Useful Reading:

How to give a bad presentation

Ian Parbery, "How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students"

Suggested List of Papers for Presentation (all papers could be accessed here)

(P1) Patrick Tendick, Norman S. Matloff: A Modified Random Perturbation Method for Database Security. ACM Trans. Database Syst. 19(1): 47-63(1994)

(P2) Rosenblum, M., and Ousterhout, J. ``The Design and Implementation of a Log-Structured Filesystem.'' ACM Transactions on Computer Systems, 10(1), February 1992, pp. 26-52.

(P3) Fred Douglis: On the Role of Compression in Distributed Systems. Operating Systems Review 27(2): 88-93 (1993)

(P4) C. Y. Chan and Y. Ioannidis. An efficient bitmap encoding scheme for selection queries. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 215--226, Philadelphia, Pennsylvania, June 1999.

(P5) Viswanath Poosala, Yannis E. Ioannidis, Peter J. Haas, Eugene J. Shekita: Improved Histograms for Selectivity Estimation of Range Predicates. SIGMOD Conference 1996: 294-305

(P6) U. Nambiar and S. Kambhampati. Answering Imprecise Database Queries: A Novel Approach, ACM WIDM, 2003.

(P7) Bita Shadgar and Ian Holyer. Adapting Databases and WebDAV Protocol. In: The Thirteen International World Wide WebConference -WWW2004, May 2004.

(P8) Huanmei Wu, Betty Salzberg, Donghui Zhang: Online Event-driven Subsequence Matching over Financial Data Streams. SIGMOD Conference 2004: 23-34

(P9) Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey Scott Vitter, Ahmed K. Elmagarmid: Rank-aware Query Optimization. SIGMOD Conference 2004: 203-214.

(P10) Chris Jermaine, Abhijit Pol, Subramanian Arumugam: Online Maintenance of Very Large Random Samples. SIGMOD Conference 2004, 299-310.

(P11) Bruno N. and Chaudhuri S. , Conditional Selectivity for Statistics on Query Expressions. Proceedings of the ACM SIGMOD , Paris, France, 2004.

(P12) A. Deligiannakis, Y. Kotidis, N. Roussopoulos. Compressing Historical Information in Sensor Networks. In Proceedings of ACM SIGMOD International Conference on Management of Data, Paris, France, June 2004.

(P13) Gang Luo, Jeffrey F. Naughton, Curt Ellmann, Michael Watzke: Toward a Progress Indicator for Database Queries. SIGMOD Conference 2004: 791-802.

(P14) Alexander S. Szalay, Jim Gray, Ani Thakar, Peter Z. Kunszt, Tanu Malik, Jordan Raddick, Christopher Stoughton, Jan vandenBerg: The SDSS skyserver: public access to the sloan digital sky server data. SIGMOD Conference 2002: 570-581.

(P15) Shivnath, Babu; Garofalakis, Minos; Rastogi, Rajeev. SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables, 2001 ACM SIGMOD International Conference on Management of Data

(P16) H. T. Kung and J. T. Robinson, "On Optimistic Methods of Concurrency Control", ACM Trans. on Database Systens, pp. 213-226 (June 1981).

(P17) M. Stonebraker. The Design of the Postgres Storage System. In P. Hammersley, editor, International Conference on Very Large Databases, pages 289--300, Brighton, England, September 1987.

(P18) Michael Stonebraker, Paul M. Aoki, Witold Litwin, Avi Pfeffer, Adam Sah, Jeff Sidell, Carl Staelin, Andrew Yu, “Mariposa: A Wide-Area Distributed Database System,” VLDB Journal 5(1), p48-63 (1996).

(P19) D. DeWitt and J. Gray, "Parallel Database Systems: The Future of High Performance Database Systems," Comm. ACM, Vol.35, No. 6, 1992, pp. 85-91.

(P20) P. O'Neil,D. Quass: Improved Query Performance with Variant Indexes. SIGMOD 1997.

(P21) A. Guttman. "R-Trees: A Dynamic Index Structure for Spatial Searching", In Proceedings of ACM SIGMOD, pages 47-57, 1984.

(P22) Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in timeseries databases, In Proc. of the ACM SIGMOD Int.Conf. on Management of Data, Minneapolis, MN (1994) 419-429

(P23) J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab and subtotals. Data Mining and Knowledge Discovery, 1:29--54, 1997.

(P24) Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. SIGMOD Conference 1997: 159-170.

(P25) Christos H. Papadimitriou: Database Metatheory: Asking the Big Queries. PODS 1995: 1-10.

Week 13: (Apr 25, 2005):

Guest Lecture by Erik Meijer from Microsoft

Lecture 13: Advanced Querying and Information Retrieval

Reading assignment: Chapter 22 from the textbook

Week 14: (May 2, 2005)

15-Minute Student Presentations:

Nagesh (P25)

Uros (P21)

Yong (P8)

Dhiraj (P3)

Prasanna (P1)

Manjit (P13)

Vasudha (P2)

Hao (P23)

Week 15: (May 3, 2005) in Wachman Hall, Room 322 at 4:40pm

Make-up lecture

15-Minute Student Presentations:

Tek (P7)

Dipen (P19)

Dave (P18)

Gaurav (P5)

Chandra (P14)

Elaine (P22)

Hetal (P17)

Tom (P4)

?? Few people have yet to choose the paper - please contact me as soon as possible ??