miyurud / jasminegraphLinks
Distributed Graph Database Server
☆18Updated last month
Alternatives and similar repositories for jasminegraph
Users that are interested in jasminegraph are comparing it to the libraries listed below
Sorting:
- Succinct C++☆24Updated 5 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 8 months ago
- Optimizing database queries with array programming☆20Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 6 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 5 years ago
- LSH index for approximate set containment search☆60Updated 3 years ago
- ibmgraphblas☆27Updated 7 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆16Updated 3 months ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆86Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- ☆20Updated 5 years ago
- Light-weight GPU kernel interface for graph operations☆15Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A CUDA implementation of the Tsetlin Machine based on bitwise operators☆26Updated 6 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 10 years ago
- Affinity Propagation for Sparse Similarities☆21Updated 15 years ago
- Space efficient (graph) algorithms☆18Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Compact Data Structures Library☆129Updated 11 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- A Clustering Based Classification Algorithm☆28Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year