kiyo-masui / bitshuffleLinks
Filter for improving compression of typed binary data.
☆230Updated 8 months ago
Alternatives and similar repositories for bitshuffle
Users that are interested in bitshuffle are comparing it to the libraries listed below
Sorting:
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆438Updated last month
- Apache Parquet☆445Updated last year
- The FastPFOR C++ library: Fast integer compression☆931Updated last month
- High-performance dictionary coding☆105Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆281Updated last week
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 8 months ago
- A simple C library for compressing lists of integers using binary packing☆506Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Memkind is an easy-to-use, general-purpose allocator which helps to fully utilize various kinds of memory available in the system, includ…☆390Updated last year
- Core C++ Sketch Library☆238Updated 3 weeks ago
- This is the official mirror of the MonetDB Mercurial repository. Please note that we do not accept pull requests on github. The regressio…☆309Updated 4 years ago
- Fast integer compression in C using the StreamVByte codec☆407Updated 6 months ago
- LSM-trie☆114Updated 4 years ago
- A fast, compressed, persistent binary data store library for C.☆523Updated this week
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Fastest Integer Compression☆809Updated last year
- Template Vector Library☆18Updated 4 years ago
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Key/Value Datastore for Persistent Memory☆403Updated 2 years ago
- Apache Quickstep Incubator - This project is retired☆95Updated 6 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆61Updated 5 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆347Updated last year
- Fast Static Symbol Table (FSST): efficient random-access string compression☆460Updated 4 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Specification of the compressed-bitmap Roaring format☆162Updated last month
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago