Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
teaching:infoh417 [2016/10/20 09:09]
svsummer [INFO-H-417 : Database Systems Architecture]
teaching:infoh417 [2016/11/24 14:39]
svsummer [COURSE TRAJECTORY]
Line 1: Line 1:
 ====== INFO-H-417 : Database Systems Architecture ====== ====== INFO-H-417 : Database Systems Architecture ======
  
-<note important>​The project ​assignment has been posted (see course program below)</​note>​+<note important>​The project ​gropus are posted (see [[http://​cs.ulb.ac.be/​public/​teaching/​infoh417/​project|project page]])</​note>​
 ===== GENERAL INFORMATION ===== ===== GENERAL INFORMATION =====
  
Line 84: Line 84:
   * In this assignment you are asked to implement an external-memory merge-sort algorithm, and examine its performance under different parameters. Be sure to visit the [[teaching:​infoh417:​project|project'​s page]] for full details and modalities. ​   * In this assignment you are asked to implement an external-memory merge-sort algorithm, and examine its performance under different parameters. Be sure to visit the [[teaching:​infoh417:​project|project'​s page]] for full details and modalities. ​
  
-==== Reading Assignment 2: Multidimensional Index Structures ====+==== Reading Assignment 2 and lecture 5: Multidimensional Index Structures ====
  
-  * There is no class on friday 28 October. Instead you are asked to read sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book.  This concerns ​we will study various index structures that deal gracefully with multidimensional search keys ({{:​teaching:​infoh417:​slides-lect5.pdf|slides}}).+  * There is no class on friday 28 October. Instead you are asked to read sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book.  This concerns various index structures that deal gracefully with multidimensional search keys ({{:​teaching:​infoh417:​slides-lect5.pdf|slides}}).
  
 +==== Lecture 6: Physical Operators ====
 +
 +  * In lecture 6 ({{:​teaching:​infoh417:​slides-lect6.pdf|slides}}),​ we study the basic algorithms for physical operators, together with their cost analysis. The details (including some algorithms not discussed during the lecture) can be found in chapter 15 sections 15.1 until 15.6, pages 701-746 (in the international edition) or pages 689-734 (in the new international edition). The interested reader is also advised to read Section 15.7 (although this will not be interrogated during the exam).
 +
 +  * You are expected to solve exercise 1 of the {{:​teaching:​infoh417:​03-physicalop-ex.pdf|physical operators exercises}} by the exercise session of November 25. 
  
 
teaching/infoh417.txt · Last modified: 2020/09/10 08:46 by svsummer