Skip to main content
Skip header

Query Processing Algorithms

Type of study Follow-up Master
Language of instruction English
Code 460-4069/04
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, and optimization techniques
2. Cost-based optimization - statistics, cost-model
3. Index selection based on cost optimization
4. Query parameterization and MEMO structure
5. Environment - main-memory/persistent environment, L2 cache, SIMD operation, parallelization
6. Graph databases - shortest distance, centrality index computation
7. Spatial queries - range query and k nearest neighbors query in low dimensions
8. Spatial queries - k nearest neighbors in high dimension, approximate nearest neighbors (ANN)
9. Set merging - full-text, similarity search
10. Semi-structured data - twig query pattern
11. Filters

Exercises will be held in a PC lab. Exercises:
1. Query plans in relational databases - display and operator meaning
2. Influence of statistics on a query plan
3. Change of query plans with respect to physical structure change
4. Test of knowledge related to query plans
5. Basic types of queries in graph databases
6. Graph query processing
7. ANN
8. Inverted list merging
9. StackTree algorithm on a tree data
10. Filter
11. Presentation of a project

E-learning

E-learning support can be found here:
- https://dbedu.cs.vsb.cz
- https://www.youtube.com/@radimbaca564

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.