Hi, Peter! > 4 дек. 2017 г., в 4:55, Peter Geoghegan <p...@bowt.ie> написал(а): > Thoughts?
I like the idea of more compact B-tree. Chances are that I didn't understood all your ideas. But ItemId's let you insert a tuple among two existing tuples without data movement. New tuple is places wherever free space starts. You just shift bytes in ItemId array. And you always have to insert tuple in specific position, since B-tree relies on tuple order. Best regards, Andrey Borodin.
