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 4 months ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆30Updated 2 weeks ago
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆223Updated 3 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 7 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last month
• 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
• robert-sedgewick / hyperbitbit
  Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
  ☆16Updated 9 months ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated 11 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• MorphStore / Engine
  ☆14Updated last year
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆125Updated last week
• 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…
  ☆151Updated last week
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 4 years ago
• mikebenfield / Learned-Index-Structures
  Learned Index Structures
  ☆50Updated 6 years ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆44Updated last month
• GraphBLAS / GraphBLAS-Pointers
  Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra
  ☆195Updated 8 months ago
• ldbc / ldbc_snb_bi
  Reference implementations for the LDBC Social Network Benchmark's Business Intelligence (BI) workload
  ☆43Updated 3 months ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 7 months ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆133Updated 2 years ago
• graphflow / graphflow-columnar-techniques
  ☆26Updated 3 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆24Updated last year
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• cornelldbgroup / skinnerdb
  SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…
  ☆49Updated last year
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆286Updated 3 years ago
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆235Updated this week
• umbra-db / diamond-vldb2024
  Reproducibility package for "Robust Join Processing with Diamond Hardened Joins"
  ☆12Updated last year