Order-Preserving Key Compression for In-Memory Search Trees · HackerPapers discussions

Order-Preserving Key Compression for In-Memory Search Trees — mentioned by BenoitP

Fri, 19 Jun 2020 08:57:11 GMT

Getting a 500 from Github. Here is their paper: https://arxiv.org/pdf/2003.02391.pdf

Paper and discussion history. A mention is not an endorsement.

Order-Preserving Key Compression for In-Memory Search Trees — HN submission

Thu, 12 Mar 2020 03:18:19 GMT

Order-Preserving Key Compression for In-Memory Search Trees

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Order-Preserving Key Compression for In-Memory Search Trees — mentioned by dgacmu

Wed, 11 Mar 2020 12:00:30 GMT

There was an aspect of that in the first part of the thesis, but the rest has techniques that are independent. You can roughly break the thesis down by paper: * Hybrid Indexes (a read-only, full-block kinda thing where you have to handle inserts by using a second read-write tree) * SuRF, a succinct range filter data structure * Order-Preserving Key Compression for In-Memory Search Trees Each of them can be used independent of the others, or combined. You can find two of those papers on Huanchen's web page: http://www.cs.cmu.edu/~huanche1/ the third is to-appear, but you can find a preprint on…

Paper and discussion history. A mention is not an endorsement.