Alternatives and similar repositories for hyperlogloglog

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

• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 2 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated 3 weeks ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated 3 weeks ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• robert-sedgewick / hyperbitbit
  Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
  ☆16Updated 7 months ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆11Updated 6 months ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆50Updated 6 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• fdbresearch / LMFAO
  Layered Multiple Functional Aggregate Optimization
  ☆18Updated 4 years ago
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆147Updated this week
• facebookresearch / vector_db_id_compression
  Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.
  ☆80Updated 4 months ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 4 years ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆221Updated 3 years ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆37Updated 2 weeks ago
• GraphBLAS / GraphBLAS-Pointers
  Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra
  ☆194Updated 7 months ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• thomasahle / tinyknn
  A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF
  ☆17Updated 2 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 5 months ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆102Updated 2 weeks ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆23Updated last year
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆19Updated 4 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆133Updated 2 years ago