Postgraduate Course: Advanced Databases (Level 11) (INFR11011)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Year 4 Undergraduate)
||Availability||Available to all students
|Summary||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.
This is an overview of what will be covered. The time spent on each part will be adjusted as the course progresses.
* B-trees, hash-based indexes, R-trees.
* Indexing structures for solid state and main memory.
* Query evaluation: sorting and join processing, aggregation
* Algorithmic adjustments for flash memory and main-memory systems.
* Query optimisation: cost-based query optimisation, dynamic programming, randomised exploration, rule-based optimisation.
* Concurrency and recovery: transactions, lock tables, main-memory concurrency control, recovery using the ARIES algorithm.
* Parallel databases: parallel query evaluation, parallel and distributed transaction processing.
Relevant QAA Computing Curriculum Sections: Databases, Data Structures and Algorithms, Software Engineering
Entry Requirements (not applicable to Visiting Students)
|| It is RECOMMENDED that students have passed
Database Systems (INFR09011) OR
Database Systems (INFR10055)
||Other requirements|| This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser.
A firm grasp of basic mathematics is expected; the course involves extracting cost models from algorithms.
A good level of programming is assumed and will not be covered during lectures. The coursework will involve implementing query processing algorithms in the context of a database system written in Java.
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Not being delivered|
| 1. Demonstrate knowledge of storage methods by enumerating various indexing techniques over single- and multi-dimensional data stored in traditional disk drives, flash memory, and main memory. 2. Demonstrate knowledge of query evaluation by describing and implementing various evaluation algorithms used by database systems in both disk- and non-volatile memory settings. 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 for disk-based, flash memory, and main memory systems. 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 parallel data management by enumerating paradigms of parallel query and transaction processing.
|* Raghu Ramakrishnan and Johannes Gehrke, Database Management Systems (Third Edition) McGraw-Hill 2003.|
* Various papers available on the topics of the syllabus.
|Course organiser||Dr Stratis Viglas
Tel: (0131 6)50 5183
|Course secretary||Ms Sarah Larios
Tel: (0131 6)51 4164