On Tue, Apr 20, 2021 at 12:35 PM Chapman Flack <c...@anastigmatix.net> wrote: > How would showing that to be true for data structure X be different from > making a case for data structure X?
You don't have to understand the theoretical basis of B-Tree indexes to see that they work well. In fact, it took at least a decade for somebody to formalize how the space utilization works with B-Trees containing random data. Of course theory matters, but the fact is that B-Trees had been widely used for commercial and scientific applications that whole time. Maybe I'll be wrong about learned indexes - who knows? But the burden of proof is not mine. I prefer to spend my time on things that I am reasonably confident will work out well ahead of time. -- Peter Geoghegan
