michaelmior / mvptree
A fork of D Grant Starkweather's multiple vantage point tree library
☆41Updated 6 years ago
Alternatives and similar repositories for mvptree:
Users that are interested in mvptree are comparing it to the libraries listed below
- C++ utility library☆24Updated 11 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 10 months ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- pythonic access to fastbit☆26Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database☆11Updated 3 years ago
- ☆25Updated 7 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- This project aims to provide a uniform representation for the data of ELF and PE binary executables.☆9Updated 6 years ago
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- hokusai -- sketching streams in real-time☆78Updated 7 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Anomaly detection for multiple data streams.☆11Updated 11 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 8 years ago
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- like ChaCha, but 64-bit instead of 32-bit thanks to BLAKE2b's permutation☆15Updated 7 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- SUccinct Retrieval Framework☆19Updated 9 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago
- bit & sketches data structures☆60Updated 6 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆77Updated 10 years ago
- C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)☆23Updated 8 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- A statically typed binary tree in Go without casts or reflection☆19Updated 11 years ago