oertl / treeminhash

Related projects: ⓘ

• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 9 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆56Updated 4 months ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 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
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆14Updated 3 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 6 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆19Updated 4 years ago
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆17Updated last month
• salviati / slash
  A locality-sensitive hashing library
  ☆45Updated 10 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 7 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated 9 months ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆13Updated 5 months ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 10 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆19Updated 4 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆22Updated 4 months ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 3 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆46Updated 2 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago