valbok / HEngineLinks
☆33Updated 5 years ago
Alternatives and similar repositories for HEngine
Users that are interested in HEngine are comparing it to the libraries listed below
Sorting:
- A library of inverted index data structures☆151Updated 3 years ago
- Simhashing in C++☆136Updated 2 years ago
- Orly™ Graph Database☆39Updated last year
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 11 years ago
- Fast decoder for VByte-compressed integers☆127Updated 2 months ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A high performance search engine☆107Updated 9 years ago
- http balancer☆74Updated 7 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated 2 years ago
- Logistic regression engine for medium-sized data☆55Updated 10 years ago
- C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet☆42Updated 9 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 4 years ago
- Fast Redis clone written in C using RocksDB as a backend.☆75Updated 4 years ago
- Fast exact nearest neighbor search in Hamming distance on binary codes with Multi-index hashing☆290Updated 10 years ago
- http server with libev and coroutines☆45Updated 6 years ago
- ☆27Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Trinity IR Infrastructure☆239Updated 6 years ago
- A very fast on-disk database for SHA1-identified objects☆57Updated 9 years ago
- Bureau 14 LevelDB branch with full Windows support. Requires Boost☆73Updated 10 years ago
- Rolling Hash C++ Library☆190Updated last year
- Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)☆108Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- An HTTP and websocket protocol implementation for libev event loop (UNMAINTAINED, use rust and tk-http crate)☆38Updated 8 years ago
- Memory-mapped storage library☆76Updated 9 years ago
- Distributed search engine in C++14, using nanomsg for communication, bond for serialization.☆67Updated 10 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 9 years ago