which data structure is used for indexing
which data structure is used for indexing Correct Answer stack
The data structure most commonly used for database indexes are B - trees, a specific kind of self - balancing tree. A picture's worth a thousand words, so here's an example. The main benefit of a B - tree is that it allows logarithmic selections, insertions, and deletions in the worst case scenario.