Showing 3 of 3 projects
A fast and space-efficient probabilistic set data structure for Go that tests membership with 'likely member' or 'definitely not member' results.
A Go implementation of a skip list data structure, inspired by Redis's zskiplist.
A high-performance Go implementation of the Ribbon filter, a space-efficient probabilistic data structure that is practically smaller than Bloom and Xor filters.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.