This document discusses Fractal Tree indexes as an alternative indexing approach for MongoDB. It provides an overview of B-trees and how Fractal Tree indexes differ by storing data in large nodes with message buffers and supporting compression. Benchmarks show that Fractal Tree indexes outperform MongoDB's default indexing, providing much better insertion and query performance. The presenter outlines an ongoing implementation within MongoDB and plans to further optimize performance and crash safety.