kiyo-masui / bitshuffleLinks
Filter for improving compression of typed binary data.
☆231Updated 11 months ago
Alternatives and similar repositories for bitshuffle
Users that are interested in bitshuffle are comparing it to the libraries listed below
Sorting:
- Core C++ Sketch Library☆244Updated 2 weeks ago
- Apache Parquet☆445Updated last year
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆440Updated 4 months ago
- Fast Approximate Membership Filters (C++)☆287Updated 3 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated 11 months ago
- High-performance dictionary coding☆108Updated 8 years ago
- Fast integer compression in C using the StreamVByte codec☆411Updated 9 months ago
- LSM-trie☆114Updated 4 years ago
- The FastPFOR C++ library: Fast integer compression☆941Updated last week
- 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
- A simple C library for compressing lists of integers using binary packing☆511Updated 2 years ago
- A fast SIMD parser for CSV files☆158Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Beta release of Masstree.☆447Updated 2 years ago
- Apache Quickstep Incubator - This project is retired☆94Updated 6 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 4 years ago
- Bloom-filter based minimal perfect hash function library☆269Updated 4 months ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- A fast, compressed, persistent binary data store library for C.☆541Updated this week
- An adaptive radix tree for efficient indexing in main memory.☆166Updated this week
- ☆111Updated last year
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆50Updated 7 months ago
- a quotient filter written in C☆87Updated 8 years ago
- First Practical and General-purpose Range Filter☆550Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast Static Symbol Table (FSST): efficient random-access string compression☆479Updated last month
- Fastest Integer Compression☆818Updated last year