Explain DB Indexing
|Index support for fast lookup||Instead of O(n), many index designs O(log(n)) lookup performance|
Q: Record lookup process?
- Some databases separate the data and index blocks into separate files, others put two completely different data blocks within the same physical file(s).
Q: How do Indexes decrease write performance?
Q: How B+ tree used in DB?
- A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.
Share It, If You Like It.