3 ms·
> I mean tbh, a list structure with logN indexed access, insert, and removal seems like a really useful structure. Indeed B-trees are hardly novel. The point
by chipdart 2y ago
> I mean tbh, a list structure with logN indexed access, insert, and removal seems like a really useful structure.
Indeed B-trees are hardly novel.
The point is that no one has a practical need to implement them themselves, unless you're working on rolling out your own database engine. If that's the case then either you're doing that for fun or there were steps in the decision process that I'd love to hear the justification.
- josephg 2y ago> I'd love to hear the justification. This is the right data structure to use for collaborative text editing. I made another comment in this thread going in to details. The fastest implementation I know of is Cola, and the author has some great posts going in to details if you’re interested: https://nomad.foo/blog/cola https://nomad.foo/blog/cola
- iamwil 2y agoSometimes, we get paid to hit the high notes, even if we don't sing them all the time, or even every day. See sibling josephg comment on use in CRDT implementation.