Question
Which data structure is commonly used for implementing
database indexes like B-trees and B+ trees, known for their efficiency in disk-based storage?Solution
B-trees and B+ trees are types of balanced tree data structures specifically designed for efficient disk I/O, making them ideal for database indexing.
Which of the following is used to speed up data retrieval in a relational database?
What does the term "referential integrity" mean in a database context?
In the context of databases, what does the term sharding refer to?
Which database model is based on the mathematical set theory and is the foundation of many modern databases?
Pick the odd one out.
What is the full form of DBMS?
How many types of architecture we have in DBMS
Which of the following joins returns all rows from both tables, filling in NULL values for non-matching rows?
Which of the following is true about Information?
Which of the following storage devices is considered non-volatile?
