The document discusses several popular algorithms for storing data on disk, including B-trees, LSM-trees, and cache-oblivious B-trees. B-trees balance speed of insertion, update, and selection but can be slow for deletes. LSM-trees are suitable for data with different degrees of recency and allow segregating data between memory and disk storage. Cache-oblivious data structures achieve optimal performance regardless of cache parameters.