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 months ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 4 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆170Updated 2 months ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 7 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…
  ☆100Updated 2 years ago
• nbronson / snaptree
  Concurrent TreeMap w/ efficient support for clone() and consistent iteration
  ☆151Updated 12 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• pbailis / ramp-sigmod2014-code
  Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014
  ☆71Updated 10 years ago
• Accla / graphulo
  Graphulo: Accumulo library of matrix math primitives and graph algorithms
  ☆79Updated 3 weeks ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆105Updated 8 years ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 9 years ago
• bdupras / guava-probably
  Probabilistic data structures for Guava.
  ☆54Updated 4 years ago
• lyogavin / Pistachio
  Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …
  ☆114Updated 10 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆128Updated 5 years ago
• stephenc / high-scale-lib
  A Mavenized fork of http://high-scale-lib.sourceforge.net/
  ☆162Updated last year
• NonVolatileComputing / Mnemonic
  Moved to Apache Mnemonic (Incubator)
  ☆20Updated 9 years ago
• hyan / kamikaze
  DocId set compression and set operation library
  ☆27Updated 11 years ago
• amplab / succinct
  Enabling queries on compressed data.
  ☆281Updated last year
• xerial / jnuma
  A Java library for accessing NUMA (Non Uniform Memory Access) API
  ☆16Updated 12 years ago
• epfldata / dblab
  A framework for building database systems by high-level programming, and getting really good performance nevertheless.
  ☆139Updated 7 years ago
• apache / incubator-retired-quickstep
  Apache Quickstep Incubator - This project is retired
  ☆95Updated 6 years ago
• metamx / extendedset
  Bitmap compression using the CONCISE algorithm
  ☆43Updated 8 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 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
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• ning / tr13
  Compact Trie Based Thinglet
  ☆29Updated 4 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