Ideas & society2020 · shared on Hacker News
Order-Preserving Key Compression for In-Memory Search Trees
Explore Order-Preserving Key Compression for In-Memory Search Trees, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Yngaut ·
Memory-Efficient Search Trees for Database Management Systems [pdf]
251 points59 comments
Yngaut ·
Hope: High-Speed Order-Preserving Encoder
20 points4 comments
Yngaut ·
Order-Preserving Key Compression for In-Memory Search Trees
1 points0 comments