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. “It allows you to index tons of information in very, very ...