Fractal tree also avoids the fragmentation problems inherent in b-tree indexing, which can slow database performance, Schwartz argued.

Fractal Tree indexing replaces the standard method of B-tree indexing. This allows databases to see dramatically improved performance, reduced database size, and increased operational efficiency ...