Alternatives and similar repositories for BitSliceIndex

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

• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆83Updated 5 months ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 7 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆172Updated 5 months 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
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• xerial / jnuma
  A Java library for accessing NUMA (Non Uniform Memory Access) API
  ☆16Updated 12 years ago
• lyogavin / Pistachio
  Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …
  ☆115Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 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
• lemire / rollinghashjava
  Rolling hash functions in Java
  ☆79Updated 9 years ago
• pbailis / ramp-sigmod2014-code
  Code for "Scalable Atomic Visibility with RAMP Transactions" in SIGMOD 2014
  ☆71Updated 10 years ago
• amplab / succinct
  Enabling queries on compressed data.
  ☆281Updated 2 years ago
• cloud-software-foundation / c5-replicator
  C5 Replicator, a Raft protocol-based replication library
  ☆34Updated 10 years ago
• nbronson / snaptree
  Concurrent TreeMap w/ efficient support for clone() and consistent iteration
  ☆152Updated 13 years ago
• metamx / extendedset
  Bitmap compression using the CONCISE algorithm
  ☆43Updated 8 years ago
• stanford-futuredata / momentsketch
  Simplified Moment Sketch Implemntation
  ☆36Updated 6 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 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.
  ☆43Updated 9 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 9 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• izenecloud / big-data-made-easy
  Big Data Made Easy
  ☆185Updated 7 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆11Updated 9 years ago
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆129Updated 5 years ago
• tristartom / key-value-store-indexing
  Secondary index on HBase
  ☆18Updated 10 years ago
• bdupras / guava-probably
  Probabilistic data structures for Guava.
  ☆54Updated 5 years ago
• giltene / LoadMeter
  A tool that records instantaneous linux load (runnabel thread count) in 1mec intervals and logs it in jHiccup-like format
  ☆20Updated 9 years ago
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 years ago