Data Management Algorithms

2023/2024

Учебный год

ENG

Обучение ведется на английском языке

6

Кредиты

Кто читает:

Департамент информатики

Статус:

Курс по выбору

Когда читается:

1-й курс, 1, 2 модуль

Преподаватель

Шуранов Евгений Витальевич

Course Syllabus

Abstract

The goal of mastering the discipline «Algorithms for data storage» is to develop students' theoretical knowledge and practical skills on the basics of building and working with data storage systems. Students will get an idea of ​​the implementation of processing and execution of queries in database management systems.

Learning Objectives

• To develop students' theoretical knowledge and practical skills on the basics of building and working with data storage systems.

Expected Learning Outcomes

• Knows: the concept of a column DBMS; history of column DBMS; prerequisites for the emergence and popularization of this approach; OLAP and OLTP, star and snowflake schemes. Owns the concepts of: computer architecture; column DBMS in memory using the MonetDB system example; BAT-algebras.
• Knows: the concept of transparency in distributed DBMS; types of transparency; aspects of distributed DBMS (autonomy, distribution, heterogeneity). Knows: the main types of distributed DBMS; optimization principles in distributed DBMS; query execution in distributed DBMS; query execution in client-server distributed DBMSs, execution strategies.
• Knows: the main components of relational DBMS; main stages of request processing; query tree concept. He knows how to implement various relational operations. He has skills in query optimization. Knows: the concept of graph connections; algorithm for constructing bushy trees.
• Knows: XML query language; XPath and XQuery XQuery runtime systems. Owns the concepts of: OODB and ORDB (data schema, queries); architecture of object systems; buffer management in object systems. Knows: hardware and software Pointer Swizzling; The concept of Path Expression, elements of optimization.
• Owns the concept of an index. Knows multi-dimensional indexing, two-step scheme. Owns the concept of an R-tree (definition, history, properties; variants of an R-tree). Knows the classification of multidimensional indexing methods; construction algorithm; query calculation algorithm
• Owns the concept of tuning a DBMS. Knows approaches to setting up the physical layer. He knows the classification of solution methods. Owns the concepts of: horizontal fragmentation; distribution of fragments by keys; iterative and combined solution of allocation and fragmentation problems.

Course Contents

• The principles of building relational DBMS
• Some issues of building distributed DBMS
• Column DBMS
• Nonclassical DBMS types: XML, graph, object
• Multidimensional Indexing Elements
• DBMS tuning task

Assessment Elements

• Course project
  The course project is issued to students in one version and consists of 15 tasks. Each task is assigned a score. The duration of the course work is 10 weeks. The form for submitting homework is an writ of execution.
• Exam
  The exam is conducted in the form of answers to the questions of the exam ticket. The exam ticket contains two questions from the list of questions for the exam. 2.5 hours are allotted for the preparation of the answer.

Interim Assessment

• 2023/2024 2nd module
  0.7 * Course project + 0.3 * Exam

Bibliography

Recommended Core Bibliography

• Pathak, N. (2008). Database Management System (Vol. 1st ed). Mumbai [India]: Himalaya Publishing House. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=327167

Recommended Additional Bibliography

• Harrington, J. L., & Harrington, J. L. (2016). Relational Database Design and Implementation (Vol. Fourth edition). Amsterdam: Morgan Kaufmann. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=1214612