hermanstehouwer / Enhanced-Suffix-ArraysLinks
A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries thanks to the implicit suffix tree structure.
☆21Updated 5 years ago
Alternatives and similar repositories for Enhanced-Suffix-Arrays
Users that are interested in Enhanced-Suffix-Arrays are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- ☆27Updated 8 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- agentzh's fork of Russ Cox's re1 toy regex library☆19Updated 12 years ago
- A handy tool to help design and parse your own language☆21Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- C++11 port of the PostgreSQL DBMS☆70Updated 9 years ago
- Reduced on-disk Suffix Array☆22Updated 12 years ago
- Library containing high-performance datastructures and utilities for C++☆75Updated 8 years ago
- A very fast on-disk database for SHA1-identified objects☆57Updated 9 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 3 weeks ago
- Distributed search engine in C++14, using nanomsg for communication, bond for serialization.☆67Updated 10 years ago
- ViyaDB in-memory columnar analytical data store☆115Updated 6 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆44Updated 9 years ago
- ☆20Updated 9 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 10 years ago
- Algorithms to compress sorted arrays of integers☆19Updated 11 years ago
- ARTful radix tree☆13Updated 8 years ago
- a c89 compiler, need total test.☆29Updated 7 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆50Updated 9 months ago
- ☆13Updated 6 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- Optimizing database queries with array programming☆20Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Toy prototype for a distributed computing system in C++☆18Updated 11 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago