Postgraduate Course: Advanced Databases (Level 11) (INFR11011)
|School||School of Informatics
||College||College of Science and Engineering
||Availability||Not available to visiting students
|Credit level (Normal year taken)||SCQF Level 11 (Postgraduate)
|Home subject area||Informatics
||Other subject area||None
||Taught in Gaelic?||No
|Course description||This course aims at furthering database systems concepts through adding complexity and a more hands-on approach. In particular, we will focus on supporting multi-dimensional data in a DBMS, query optimisation, query evaluation, transaction processing and concurrency control in both a centralised and a distributed context. In terms of centralised databases, we shall start from single and multi-dimensional indexing methods, move on to join evaluation algorithms, and talk about query opimisation paradigms. We shall then focus on the issues of transaction processing, concurrency control and crash recovery. Finally, we shall revisit the previous issues in a distributed database environment.
Entry Requirements (not applicable to Visiting Students)
|| It is RECOMMENDED that students have passed
Database Systems (INFR09011)
|Prohibited Combinations|| Students MUST NOT also be taking
Advanced Databases (Level 10) (INFR10002)
||Other requirements|| For Informatics PG and final year MInf students only, or by special permission of the School. In particular, students should be familiar with file structures and query processing algorithms.
|Additional Costs|| None
Course Delivery Information
|Delivery period: 2011/12 Semester 2, Not available to visiting students (SS1)
||WebCT enabled: No
|No Classes have been defined for this Course|
||Week 1, Monday, 11:10 - 12:00, Zone: Central. Robson LT |
|Main Exam Diet S2 (April/May)||2:00|
Summary of Intended Learning Outcomes
|1 - Demonstrate knowledge of storage methods by enumerating various indexing techniques over single- and multi-dimensional data.
2 - Demonstrate knowledge of query evaluation by describing and implementing various evaluation algorithms used by database systems.
3 - Demonstrate knowledge of cost-based query optimisation by describing search space exploration and different optimisation paradigms.
4 - Demonstrate knowledge of transaction processing and concurrency control using lock tables and/or optimisic methods of concurrency control.
5 - Demonstrate knowledge of crash recovery by describing the methodologies and algorithms employed by a database system in the event of a crash.
6 - Demonstrate knowledge of distributed database functionality in terms of query evaluation and transaction processing.
|Written Examination 70|
Assessed Assignments 30
Oral Presentations 0
Two programming assignments. The assignments will account in total for 30% of the final grade.
||This is a rough overview of what will ideally be covered if time permits. If needed, the time spent on each part will be adjusted as the course progresses.
* B-trees, hash-based indexes, R-trees and Grid files.
* Query evaluation: join algorithms (nested-loops join, sort-merge join, hash join, Grace join and hybrid-hash join.)
* Query optimisation: cost-based query optimisation, dynamic programming, randomised exploration, rule-based optimisation.
* Concurrency and recovery: transactions, lock tables, optimistic concurrency control, recovery using the ARIES algorithm.
* Distributed databases: distributed query evaluation, distributed transaction processing.
Relevant QAA Computing Curriculum Sections: Databases, Data Structures and Algorithms, Software Engineering
||* Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems (Third Edition) McGraw-Hill 2003.
* Various papers available on the topics of the syllabus.
Timetabled Laboratories 0
Non-timetabled assessed assignments 50
Private Study/Other 30
|Course organiser||Dr Michael Rovatsos
Tel: (0131 6)51 3263
|Course secretary||Miss Kate Weston
Tel: (0131 6)50 2701
© Copyright 2011 The University of Edinburgh - 16 January 2012 6:17 am