In rdbms, explain what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 1026 Views
- I also Faced
- E-Mail Answers
Answer / Ajay Kumar
In RDBMS (Relational Database Management Systems), the most common and efficient data structure used for internal storage representation is called a B-Tree or B+ Tree. These are multi-level indexing schemes that provide fast search, insert, and delete operations. The B-Tree allows for efficient management of large amounts of data in disk files and can be used as the basis for other database structures like Indexes, Inverted Files, etc.
| Is This Answer Correct ? | 0 Yes | 0 No |
Which sorting does collections sort use?
What is the space complexity of quicksort?
What is the complexity of sorting algorithm?
When is a binary search best applied?
Which is better than array and linked list?
Which is the slowest sorting algorithm?
What is difference between treeset hashset linkedhashset?
What is nsmutablearray?
Can you provide some implementation of a dictionary having large number of words?
What is the use of data structure in real life?
What is data structure and its operations?
What is the basic of data structure?
Windows 
