kiyo-masui / bitshuffleLinks
Filter for improving compression of typed binary data.
☆232Updated 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
- High-performance dictionary coding☆108Updated 8 years ago
- Core C++ Sketch Library☆251Updated last month
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆441Updated 6 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 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…☆392Updated last year
- Benchmark of common hash functions☆36Updated 6 years ago
- The FastPFOR C++ library: Fast integer compression☆950Updated 3 weeks ago
- LSM-trie☆114Updated 4 years 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 5 years ago
- A simple C library for compressing lists of integers using binary packing☆514Updated 2 years ago
- Fast integer compression in C using the StreamVByte codec☆412Updated 11 months ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- C++ version of Ted Dunning's merging t-digest☆31Updated 2 months ago
- An adaptive radix tree for efficient indexing in main memory.☆167Updated last month
- 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
- Persistent memory allocator for data-centric analytics☆58Updated 2 months ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Apache Quickstep Incubator - This project is retired☆94Updated 7 years ago
- Template Vector Library☆18Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- Beta release of Masstree.☆450Updated 2 years ago
- A fast SIMD parser for CSV files☆160Updated 3 years ago
- Fastest Integer Compression☆819Updated last year
- Key/Value Datastore for Persistent Memory☆403Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago