The problem is, B-Tree indexing imposes inherent limits on an application, says Thomas Hazel, the founder of Deep Information Sciences and its chief scientist/architect. “Think of classic B Plus trees ...

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 ...