Describe tree database. Explain its common uses.
- 1 Answers
- 1079 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
What is the Difference between treemap and hashmap?
Which is better arraylist or linkedlist?
What is declaring array?
List out a few of the applications that make use of Multilinked Structures?
Which sorting is used in collections sort?
What is map entry?
Where the data structures are used?
What are the disadvantages of circular list?
Why quicksort is better than merge sort?
How memory is reserved using a declaration statement in data structure?
Is hashset a collection?
What are different sorting algorithms?
Windows 
