kiyo-masui / bitshuffleLinks
Filter for improving compression of typed binary data.
☆233Updated last year
Alternatives and similar repositories for bitshuffle
Users that are interested in bitshuffle are comparing it to the libraries listed below
Sorting:
- Apache Parquet☆445Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆443Updated 6 months ago
- Fast integer compression in C using the StreamVByte codec☆413Updated 11 months ago
- The FastPFOR C++ library: Fast integer compression☆952Updated last month
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago
- Core C++ Sketch Library☆253Updated this week
- Fast Approximate Membership Filters (C++)☆288Updated 5 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- C++ version of Ted Dunning's merging t-digest☆31Updated 3 months ago
- A simple C library for compressing lists of integers using binary packing☆515Updated 2 years ago
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- Fastest Integer Compression☆822Updated last year
- A fast, compressed, persistent binary data store library for C.☆546Updated this week
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- This is the official mirror of the MonetDB Mercurial repository. Please note that we do not accept pull requests on github. The regressio…☆309Updated 5 years ago
- Fast Static Symbol Table (FSST): efficient random-access string compression☆492Updated 2 months ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Benchmark of common hash functions☆37Updated 6 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Bloom-filter based minimal perfect hash function library☆271Updated 6 months ago
- LSM-trie☆114Updated 4 years ago
- Dumps of CRoaring unity builds (for convenience)☆23Updated 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…☆395Updated last year
- Apache Quickstep Incubator - This project is retired☆94Updated 7 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆354Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- Key/Value Datastore for Persistent Memory☆404Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago