hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.2498/cit.1002310

Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases

Serhiy Morozov ; University of Detroit Mercy, Detroit MI, USA
Hossein Saiedian ; University of Kansas, Lawrence KS, USA
Hanzhang Wang ; University of Detroit Mercy, Detroit MI, USA

Fulltext: english, PDF (477 KB) pages 31-44 downloads: 595* cite
APA 6th Edition
Morozov, S., Saiedian, H. & Wang, H. (2014). Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases. Journal of computing and information technology, 22 (1), 31-44. https://doi.org/10.2498/cit.1002310
MLA 8th Edition
Morozov, Serhiy, et al. "Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases." Journal of computing and information technology, vol. 22, no. 1, 2014, pp. 31-44. https://doi.org/10.2498/cit.1002310. Accessed 19 Apr. 2021.
Chicago 17th Edition
Morozov, Serhiy, Hossein Saiedian and Hanzhang Wang. "Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases." Journal of computing and information technology 22, no. 1 (2014): 31-44. https://doi.org/10.2498/cit.1002310
Harvard
Morozov, S., Saiedian, H., and Wang, H. (2014). 'Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases', Journal of computing and information technology, 22(1), pp. 31-44. https://doi.org/10.2498/cit.1002310
Vancouver
Morozov S, Saiedian H, Wang H. Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases. Journal of computing and information technology [Internet]. 2014 [cited 2021 April 19];22(1):31-44. https://doi.org/10.2498/cit.1002310
IEEE
S. Morozov, H. Saiedian and H. Wang, "Reusable Prime Number Labeling Scheme for Hierarchical Data Representation in Relational Databases", Journal of computing and information technology, vol.22, no. 1, pp. 31-44, 2014. [Online]. https://doi.org/10.2498/cit.1002310

Abstracts
Hierarchical data structures are important for many computing and information science disciplines including data mining, terrain modeling, and image analysis. There are many specialized hierarchical data management systems, but they are not always available. Alternatively, relational databases are far more common and offer superior reliability, scalability, and performance. However, relational databases cannot natively store and manage hierarchical data. Labeling schemes resolve this issue by labeling all nodes with alphanumeric strings that can be safely stored and retrieved from a database. One such scheme uses prime numbers for its labeling purposes, however the performance and space utilization of this method are not optimal. We propose a more efficient and compact version of this approach.

Keywords
hierarchical data structures; data labeling schemes; relational database systems; prime number labeling; performance evaluation

Hrčak ID: 123176

URI
https://hrcak.srce.hr/123176

Visits: 766 *