Showing 3 of 3 projects
A high-performance, memory-efficient Go implementation of Adaptive Radix Trees with zero-allocation searches and ordered iteration.
A high-performance SIMD-vectorized bitmap index implementation in Go for dense small-to-medium collections.
A .NET library providing an in-memory data structure with efficient indexing and querying, including range, spatial, vector, and fuzzy string matching.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.