Abstract: Hierarchical data are found in a variety of database applications, including content management categories, forums, business organization charts, and product categories. In this paper, we will examine two models deal with hierarchical data in relational databases namely, adjacency list model and nested set model. We analysed these models by executing various operations and queries in a web-application for the management of categories, thus highlighting the results obtained during performance comparison tests. The purpose of this paper is to present the advantages and disadvantages of using an adjacency list model compared to nested set model in a relational database integrated into an application for the management of categories, which needs to manipulate a big amount of hierarchical data.

Cornelia Gyorödi, Romulus-Radu Moldovan-Duse, Robert Gyorödi and George Pecherle, “Improve Query Performance On Hierarchical Data. Adjacency List Model Vs. Nested Set Model” International Journal of Advanced Computer Science and Applications(IJACSA), 7(4), 2016. http://dx.doi.org/10.14569/IJACSA.2016.070434

@article{Gyorödi2016,
title = {Improve Query Performance On Hierarchical Data. Adjacency List Model Vs. Nested Set Model},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.070434},
url = {http://dx.doi.org/10.14569/IJACSA.2016.070434},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {4},
author = {Cornelia Gyorödi and Romulus-Radu Moldovan-Duse and Robert Gyorödi and George Pecherle}
}