Alternatives and similar repositories for roaringbitmap

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

• Ezibenroc / PyRoaringBitMap
  Python library for handling efficiently sorted integer sets.
  ☆227Updated 2 months ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 9 years ago
• ascv / HyperLogLog
  Fast HyperLogLog for Python.
  ☆110Updated 4 months ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last week
• blaze / chest
  Simple spill-to-disk dictionary
  ☆61Updated 3 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆305Updated last year
• prashnts / pybloomfiltermmap3
  Fast Python Bloom Filter using Mmap
  ☆132Updated 3 months ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆119Updated 3 months ago
• naftaliharris / lazysort
  A partially and lazily sorted list data structure for Python
  ☆125Updated 5 years ago
• flier / pyfasthash
  Python Non-cryptographic Hash Library
  ☆288Updated 2 years ago
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 8 years ago
• eugene-eeo / graphlite
  embedded graph datastore
  ☆185Updated 7 years ago
• stephan-hof / pyrocksdb
  Python bindings for RocksDB
  ☆150Updated 4 years ago
• coleifer / python-lsm-db
  Python bindings for the SQLite4 LSM database.
  ☆132Updated 5 months ago
• seomoz / simhash-cpp
  Simhashing in C++
  ☆135Updated 2 years ago
• twmht / python-rocksdb
  Python bindings for RocksDB
  ☆280Updated 2 years ago
• mynameisfiber / fuggetaboutit
  implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!
  ☆42Updated 8 years ago
• svpcom / hyperloglog
  Hyper LogLog (native and sliding) cardinality counters
  ☆242Updated 4 months ago
• pombredanne / SimSearch
  Implementation of Bayesian Sets for fast similarity searches.
  ☆14Updated 14 years ago
• borzunov / cpmoptimize
  🚀 🐍 Optimizes Python bytecode calculating linear recurrences, reducing the time complexity from O(n) to O(log n)
  ☆183Updated 3 years ago
• axiak / pybloomfiltermmap
  Fast Python Bloom Filter using Mmap
  ☆747Updated 6 years ago
• zopefoundation / BTrees
  ☆84Updated 3 weeks ago
• fastforwardlabs / cuckoofilter
  ☆40Updated 8 years ago
• coleifer / sophy
  Fast Python bindings to Sophia Database
  ☆81Updated last year
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 4 years ago
• diffeo / py-nilsimsa
  Locality-sensitive hashing algorithm for text similarity comparisons
  ☆59Updated 8 months ago
• axiak / pyre2
  Python wrapper for RE2
  ☆297Updated 2 years ago
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆546Updated last month
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• simonemainardi / LSHash
  A fast Python implementation of locality sensitive hashing.
  ☆71Updated 10 years ago