Skip to main content
Skip header
Terminated in academic year 2022/2023

Query Processing Algorithms

Type of study Follow-up Master
Language of instruction English
Code 460-4069/02
Abbreviation AVD
Course title Query Processing Algorithms
Credits 4
Coordinating department Department of Computer Science
Course coordinator doc. Ing. Radim Bača, Ph.D.

Subject syllabus

Lectures:
1. Relational data processing principles - query plan, plan rewritings
2. Basic algorithms in relational databases - joins (algorithms, data structures)
3. Cost-based optimization - histograms, cost-model
4. Summary - complex examples
5. Spatial queries - range query, top-k nearest neighbor
6. Spatial queries - data structures
7. XML databases - path and twig queries
8. XML databases - twig query holistic joins
9. Graph databases - shortest distance, centrality index computation
10. Environment - paralelization, L2 caches
11. Environment - main-memory/persistent environment, ACID support
12. Approximation, Bloom filters

Excercises will be held in a PC lab. Excercises:
1. Query plans in relational databases - display and operator meaning
2. Change of query plans with respect to physical structure change
3. Influence of a statistics on a query plan
4. Test of a knowledge related to query plans
5. Range query processing
6. Indexes and algoithms for XML databases
7. Graph databases
8. Optimalization of queries with repsect to an enviroment
9. Integration of Bloom filters
10. Test

Literature

[1] G.Fritchey. SQL Server Execution Plans. Simple Talk Publishing, 2012, ISBN: 978-1-906434-92-2 
[2] B. Nevarez. Inside the SQL Server Query Optimizer. Simple Talk Publishing, 2010, ISBN: 978-1-906434-57-1 

Advised literature

[1] H.Garcia-Molina, J.D.Ullman, J.D.Widom. Database Systems: The Complete Book, Prentice Hall, ISBN 0-13-031995-3, 2002.