Skip to content

Details

Our next paper is "The Ubiquitous B-Tree" by Comer. This paper reviews a foundational database structure still widely used today.

B-trees have become a de facto standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and implemented using B-trees This paper reviews B-trees and shows why they have been so successful. It discusses the major variations of the B-tree, especially the B+-tree, contrasting the relative merits and costs of each implementation. It illustrates a general purpose access method which uses a B-tree.

Link: https://carlosproal.com/ir/papers/p121-comer.pdf

Afterwards we'll socialize with a drink and a bite somewhere nearby.

We will let you in so please arrive on time.

Related topics

Events in Portland, OR
Database Development
Algorithms
Computer Science
Data Structures

You may also like