Database Tuning, Spring 2007

[News] [Schedule] [Course description] [Intranet]

News

Milan has office hours Tuesdays, 13-15, in room 3C 10. You are also welcome to contact him by e-mail.

Schedule

The schedule is preliminary. It will be updated during the course. Literature in parenthesis is background reading that might be helpful, but not curriculum.

Date	Time	Subject	Literature	Material	Place
Feb. 1	10.00-12.00	RP: Introduction. Recap of database background. (Slides.) Overview of lectures (slides).	(RG 1.5-1.8, RG 4.2); SB 1	exercise	3A 18
Feb 6	10.00-12.00	Start of project part 1		deliverable 1	3A 18
Feb. 8	10.00-15.00	SR: Tree Indexes. (Slides) (slides for paper) (slides for ISAM)	RG 10; (RG 8); [Pagh03, sec. 2.3.0, 2.3.1, 2.3.2], [BrodalFagerberg03, sec. 1 and 3.4].		3A 18
Feb 13	13.00-15.00	Project supervision (office hours)			3A 10
Feb. 15	10.00-15.00	RP: Hash Indexes, Index Tuning (slides).	RG 11; RG 20.0-20.6; SB 3 (except 3.4, 3.10); SB 6.6; [Pagh03, sec. 2.4.1-2.4.3]; [JensenPagh06, sec. 1, 2.0, 2.1]		3A 18
Feb 20	10.00-15.00	Start of project part 2. Part 1 feedback		deliverable 2	3A 18
Feb. 22	10.00-15.00	lecture cancelled			3A 18
Feb 27		Project supervision			tba.
March 1	10.00-15.00	SR: Data storage (slides), external sorting (slides), lower bound.	RG 9, 13; (SB 2.4); [Sanders03, 1.3-1.5], [MaheshwariZeh03, 3.1-3.2].		3A 18
March 6		Project supervision			tba.
March 8	10.00-15.00	SR: Evaluation of relational operators (slides)	RG 14; (RG 12)		3A 18
March 13	10.00-13.00	RP: Query Optimization, Query tuning (slides)	RG 15; (RG 12); SB 4		3A 18
March 15	10.00-12.00	Start of project part 3. Feedback on part 2		deliverable 3	3A 18
March 20		Project supervision			tba.
March 22	10.00-15.00	RP: Concurrency control (slides).	RG 17; SB 2.2, 2.3; (RG 16)		3A 18
March 27		Work on deliverable 3			tba.
March 29	10.00-15.00	SR: Spatial databases (slides).	RG 28		3A 18
April 3		Easter break
April 5		Easter break
April 10		Feedback by e-mail			3A 18
April 12	10.00-15.00	SR: Temporal databases (slides).	[Arge01, sec. 1, 2.1 (persistent B-trees), 3-4 (static versions only), 4.1; ArgeDannerTeh03, sec. 2,2.1]		3A 18
April 17		Start of project part 4		deliverable 4	3A 18
April 19	10.00-15.00	SR: Text indexing (slides)	[KarkkainenRao03, sec. 7.1-7.4]		3A 18
April 24		Project supervision			tba.
April 26		RP: Decision support, OLAP (slides)	RG 25, [WOS04, sec. 1+2], [DSTW03, sec. 1+2+3.0]		3A 18
May 1		Project supervision			tba.
May 3	10.00-15.00;	RP: ITU research in databases (slides). Course summary (slides).	Background literature (not curriculum): [PP06 sec. 1-3], [PPR05 sec. 1-2], [FPP06 sec. 1-2], [PPT04 sec. 1-3], [BHPPRT06, sec. 1,3,4.0,4.1], [JP06, sec. 1.0, 1.1, 2.0, 2.1]		3A 18
May 8	10.00-12.00	Project: Discussion of extensions		Project - final part	3A 18
May 10	10.00-12.00	Invited lecture: Peter Steen Nielsen, head of databases, Danske Bank			3A 18
May 23	15.00	Deadline for project reports			tba.
June 25	10.00-11.00	Q&A session			2A 18
June 27		Oral exams			tba.

Literature:

• GUW = Database systems - The complete book by Garcia-Molina, Ullman, and Widom.
• [MehtaAgrawalRissanen96] = M Mehta, R Agrawal, and J Rissanen. SLIQ: A fast scalable classifier for data mining. Proceedings of EDBT '96.
• [AgrawalSrikant94] = R Agrawal, R Srikant. Fast Algorithms for Mining Association Rules. Proceedings of the 20th International Conference on Very Large Data Bases, 1994.
• [AGMS99] = N Alon, P Gibbons, Y Matias, M Szegedy. Tracking join and self-join sizes in limited storage. PODS '99.
• [Arge01] = Lars Arge. External memory data structures.
• [ArgeDannerTeh03] = Lars Arge, Andrew Danner, and Sha-Mayn Teh. I/O-efficient Point Location using Persistent B-trees. ALENEX'03.
• [BrinPage98] = Sergey Brin and Lawrence Page. The Anatomy of a Large-Scale Hypertextual Web Search Engine.
• [BrodalFagerberg03] = Gerth Brodal and Rolf Fagerberg. Lower Bounds for External Memory Dictionaries
• [CLR90] = Cormen, Leiserson, and Rivest. Introduction to Algorithms.
• [CLRS01] = Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms, 2nd edition.
• [KarkkainenRao03] = Juha Karkkainen and S. Srinivasa Rao. Full-text Indexes in External Memory. (bibliography.)
• [MaheshwariZeh03] = Anil Maheshwari and Norbert Zeh. A Survey of Techniques for Designing I/O-Efficient Algorithms.
• [RG] = Ramakrishnan and Gehrke. Database Management Systems, 3rd ed.
• [Sanders03] = Peter Sanders. Memory Hierarchies - Models and Lower bounds. (bibliography.)
• [SB] = Sasha and Bonnet. Database Tuning: principles, experiments, and troubleshooting techniques.
• [Pagh03] = Rasmus Pagh. Basic External Memory Data Structures. (bibliography.)
• [Ullman00] = Jeff Ullman. Association rules and frequent itemsets. Note for CS345, Stanford University, 2000.

Literature

• Database Management Systems, 3rd edition, by Raghu Ramakrishnan and Johannes Gehrke, McGraw-Hill, 2002. ISBN: 0071230572.
  
• Database Tuning. Principles, Experiments, and Troubleshooting Techniques, by Dennis Shasha and Philippe Bonnet, Morgan Kaufmann, 2003. ISBN: 1558607536.
  

• Oracle 10g SQL reference. Free, but requires registration.
• Oracle Performance Tuning Guide (Query Execution Plans)
• Oracle XE is a DBMS with similar functionality as the one installed at ITU. It is free to download and install on Windows or Linux.
• "Database Management Systems" website with supporting material.
• "Database Tuning" website.
• CutePDF (free) can be used to generate PDF files in Windows.
• Project groups, with e-mail addresses (on intranet).
• Exams from the course Advanced Database Technology: June 2003, June 2004, June 2005, and June 2006 (example solutions).

Manning of course