Answer Posted / Kamal Kishor
A tree database (also known as a hierarchical database) is a type of non-relational database that stores data in a tree-like structure. The primary advantage of using a tree database is that it naturally supports hierarchical relationships between entities, making it ideal for modeling complex data structures with parent-child relationships. Common uses include:
1. Organizing content management systems (CMS) and document management systems (DMS).
2. Representing file systems in computer operating systems.
3. Modeling organizational hierarchies, such as company departments or family trees.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
What sort of serious problems have you experienced, and how have you handled them?
Write a program for Sorting an Array. Which sorting will you prefer?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Can you declare an array without assigning the size of an array?
