MongoDB uses _______ for defining indexes to improve query performance.
- AVL trees
- B-trees
- Binary Search Trees
- Hashing
MongoDB primarily uses B-trees (balanced trees) for indexing. B-trees are well-suited for disk-based storage systems and efficiently support range queries and updates, enhancing query performance.
Loading...
Related Quiz
- What is the purpose of mocking in Go?
- How can you specify the number of iterations to run during benchmarking in Go?
- What keyword is used to start a switch statement in Go?
- What considerations would you take into account when designing a RESTful API in Go?
- How does code coverage help in identifying untested parts of the code?