Alternatives and similar repositories for BitSliceIndex

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

• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆79Updated 2 weeks ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 7 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 4 years ago
• indeedeng / mph-table
  Immutable key/value store with efficient space utilization and fast reads. They are ideal for the use-case of tables built by batch proce…
  ☆98Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆163Updated 3 weeks ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• stanford-futuredata / momentsketch
  Simplified Moment Sketch Implemntation
  ☆36Updated 6 years ago
• pbailis / ramp-sigmod2014-code
  Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014
  ☆71Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆24Updated 6 years ago
• nbronson / snaptree
  Concurrent TreeMap w/ efficient support for clone() and consistent iteration
  ☆151Updated 12 years ago
• NonVolatileComputing / Mnemonic
  Moved to Apache Mnemonic (Incubator)
  ☆20Updated 9 years ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 9 years ago
• burmanm / compression-int
  64-bit integer compression algorithms in Java
  ☆15Updated 6 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• bdupras / guava-probably
  Probabilistic data structures for Guava.
  ☆54Updated 4 years ago
• mspiegel / lockfreeskiptree
  Drop-in replacement for java.util.concurrent.ConcurrentSkipList[Map|Set]
  ☆29Updated 15 years ago
• metamx / extendedset
  Bitmap compression using the CONCISE algorithm
  ☆43Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• jinfengr / time-series-compression
  Compressing and Decoding Term Statistics Time Series -- ECIR 2016
  ☆10Updated 9 years ago
• bryanduxbury / lightweight_trie
  A very memory-efficient trie (radix tree) implementation
  ☆47Updated 13 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆126Updated 5 years ago
• edwardw / high-scale-java-lib
  A Lock-Free Concurrent Hash Table
  ☆20Updated 14 years ago