Reusable prime number labeling scheme for hierarchical data representation in relational databases

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free