Обробка ієрархічних даних у реляційній базі даних

Abstract

Storing and using hierarchical data structures in relational databases was not the main purpose of their creation. Therefore, SQL databases do not offer a standard way to work with such data. There are special databases for working with graphs. For example Gremlin, SPARAQL, Cypher. But if in the project there is no possibility to use them and it is necessary to work with hierarchical structures through SQL, certain methods which allow to solve this problem are applied. The purpose of the study is to find an improved method of working with hierarchical structures, which will be both fast and intuitive. Investigate and compare different methods and algorithms, determine the speed of these methods and the influence of the depth of the hierarchical structure on the speed. Develop an application for testing methods of working with different tree structures in SQL. Object and subject of the research is the features of methods and algorithms that allow to solve various problems of working with hierarchical data in SQL. The subject of research is to determine the pros and cons of each method, choose the best and test the performance of each method. Scientific novelty and practical significance of the obtained results are included in working with hierarchical data in relational databases is common in many applications, so finding the best method will solve most of the problems faced by software developers.