Experiments with array layouts for comparison-based searching
☆88Jan 5, 2024Updated 2 years ago
Alternatives and similar repositories for arraylayout
Users that are interested in arraylayout are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated 2 months ago
- Sample implementation of suffix array construction algorithm, SA-IS.☆10Aug 18, 2011Updated 15 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated 2 years ago
- A Unified Framework for Benchmarking Large-Scale Graph Containers☆13Jun 7, 2025Updated last year
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- C++ modelling library for integer programming☆15Oct 4, 2020Updated 6 years ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Columnar query processing engine in Rust☆31Jun 4, 2024Updated 2 years ago
- A collection of demonstration languages in Lua/Terra suitable for learning or for forking when creating a new language☆12Aug 27, 2015Updated 11 years ago
- Compact tries for fixed-width keys☆29Jun 4, 2018Updated 8 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆55Apr 19, 2024Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆53May 2, 2017Updated 9 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆27Apr 26, 2022Updated 4 years ago
- Go implementation of SIMD-BP128 integer encoding and decoding☆32Apr 8, 2022Updated 4 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- Not Another Range Library☆39Mar 9, 2014Updated 12 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- C++17 version of lexertl☆12Oct 29, 2026Updated 2 weeks ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- qp tries and crit-bit tries☆123Jul 12, 2022Updated 4 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 11 years ago
- Vectorized intersections (research code)☆17Jan 13, 2017Updated 9 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- ☆13Sep 30, 2020Updated 6 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated 2 months ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆25Nov 21, 2025Updated 11 months ago
- Weighted HyperFlowCutter☆10Nov 4, 2026Updated 2 weeks ago
- Header only C++14 micro benchmark☆14Jan 4, 2016Updated 10 years ago
- ☆15Dec 2, 2019Updated 6 years ago
- A C++ library for integer array compression☆31Mar 18, 2022Updated 4 years ago
Are these results useful?