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.
  ☆228Updated 3 months ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 9 years ago
• ascv / HyperLogLog
  Fast HyperLogLog for Python.
  ☆110Updated 5 months ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆305Updated last year
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last month
• coleifer / python-lsm-db
  Python bindings for the SQLite4 LSM database.
  ☆132Updated 3 weeks ago
• blaze / chest
  Simple spill-to-disk dictionary
  ☆62Updated 4 years ago
• flier / pyfasthash
  Python Non-cryptographic Hash Library
  ☆287Updated 2 years ago
• stephan-hof / pyrocksdb
  Python bindings for RocksDB
  ☆150Updated 4 years ago
• naftaliharris / lazysort
  A partially and lazily sorted list data structure for Python
  ☆125Updated 5 years ago
• axiak / pybloomfiltermmap
  Fast Python Bloom Filter using Mmap
  ☆747Updated 6 years ago
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 8 years ago
• svpcom / hyperloglog
  Hyper LogLog (native and sliding) cardinality counters
  ☆241Updated 5 months ago
• prashnts / pybloomfiltermmap3
  Fast Python Bloom Filter using Mmap
  ☆133Updated 4 months ago
• coleifer / sophy
  Fast Python bindings to Sophia Database
  ☆81Updated 3 weeks ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆120Updated last month
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 4 years ago
• pbrady / fastcache
  C implementation of Python 3 lru_cache
  ☆158Updated 5 years ago
• axiak / pyre2
  Python wrapper for RE2
  ☆297Updated 2 years ago
• uqfoundation / klepto
  persistent caching to memory, disk, or database
  ☆278Updated last week
• eugene-eeo / graphlite
  embedded graph datastore
  ☆185Updated 7 years ago
• amitdev / lru-dict
  A fast and memory efficient LRU cache for Python
  ☆280Updated 3 months ago
• blaze / castra
  Partitioned storage system based on blosc. **No longer actively maintained.**
  ☆155Updated 9 years ago
• visualfabriq / bquery
  A query and aggregation framework for Bcolz (W2013-01)
  ☆56Updated last year
• seomoz / simhash-cpp
  Simhashing in C++
  ☆136Updated 2 years ago
• twmht / python-rocksdb
  Python bindings for RocksDB
  ☆280Updated 2 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• KeyviDev / keyvi
  Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
  ☆257Updated this week
• DanielStutzbach / blist
  A list-like type with better asymptotic performance and similar performance on small lists
  ☆316Updated 3 years ago
• diffeo / py-nilsimsa
  Locality-sensitive hashing algorithm for text similarity comparisons
  ☆59Updated 9 months ago