Fast Succinct Retrieval and Approximate Membership using Ribbon — mentioned by f_devd

Fri, 02 May 2025 13:54:03 GMT

Also based on Ribbon, the BuRR filters: https://arxiv.org/pdf/2109.01892 which seem to get very close to the theoretical optimum, 0.1%-0.5% overhead comparatively

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

Fast Succinct Retrieval and Approximate Membership using Ribbon — mentioned by judofyr

Wed, 22 May 2024 20:47:49 GMT

Very interesting and I'll have to read more to understand how it fully works, but _initially_ the space requirements doesn't seem too impressive? Am I missing something here? Is my calculation/assumption completely off? Maybe the solution here is more flexible? One alternative approach for many of these problems is to start with a perfect minimal hash function which hashes your key into a unique number [0, N) and then have a packed array of size N where each element is of a fixed byte size. To look up the value you first use the hash function to get an index, and then you look up in the…

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

Fast Succinct Retrieval and Approximate Membership using Ribbon · HackerPapers discussions

Fast Succinct Retrieval and Approximate Membership using Ribbon — mentioned by f_devd

Fast Succinct Retrieval and Approximate Membership using Ribbon — mentioned by judofyr