Alternatives and similar repositories for jasminegraph

Users that are interested in jasminegraph are comparing it to the libraries listed below

• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• CMU-SAFARI / Shifted-Hamming-Distance
  Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal pa…
  ☆36Updated 5 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆17Updated 5 months ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• turpinandrew / shuff
  Static Huffman coding
  ☆10Updated 8 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆157Updated last year
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• gakhov / pdsa
  Probabilistic Data Structures and Algorithms in Python
  ☆131Updated 5 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• MonetDB / MonetDBLite-C
  MonetDB as a shared library with a C API
  ☆32Updated 3 years ago
• DaMSL / K3
  K3: A Declarative Data Systems Programming Framework
  ☆15Updated 9 years ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆20Updated 5 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated 8 months ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆61Updated 3 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated 7 months ago
• hornet-gt / hornetsnest
  High-Performance Streaming Graph Analytics on GPUs
  ☆34Updated 6 years ago
• uwmisl / puddle
  A system for high-level, reliable programming of microfluidic devices
  ☆38Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• IBM / ibmgraphblas
  ibmgraphblas
  ☆27Updated 7 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆90Updated 6 years ago
• ashvardanian / SmashTable
  If only std::set was a DBMS: collection of templated ACID in-memory exception-free thread-safe and concurrent containers in a header-only…
  ☆43Updated 2 months ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago