B-Trees
摘要
This chapter covers one of the more important data structures of the last thirty years. B-Trees are primarily used by relational databases to efficiently implement an operation called join. B-Trees have other properties that are also useful for databases including ordering of rows within a table, fast delete capability, and sequential access.