Alternatives and similar repositories for hyperlogloglog:

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

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• robert-sedgewick / hyperbitbit
  Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
  ☆16Updated 5 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆43Updated last week
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months 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…
  ☆137Updated last week
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 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
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆132Updated last year
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆204Updated 3 months ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆11Updated 4 months ago
• obliviousram / PathOHeap
  Path Oblivious Heap C++ Reference Implementation
  ☆22Updated 5 years ago
• umbra-db / diamond-vldb2024
  Reproducibility package for "Robust Join Processing with Diamond Hardened Joins"
  ☆11Updated 8 months ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆15Updated 3 weeks ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• wheatman / BP-Tree
  ☆14Updated 2 months ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 4 months ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆27Updated this week
• gunrock / graphblast
  High-Performance Linear Algebra-based Graph Primitives on GPUs
  ☆222Updated 3 years ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆50Updated 6 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 2 months ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆23Updated last year
• ldbc / ldbc_snb_bi
  Reference implementations for the LDBC Social Network Benchmark's Business Intelligence (BI) workload
  ☆40Updated this week