Alternatives and similar repositories for cowic

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

• logpai / logzip
  An optimized log compression tool via iterative clustering [ASE'19]
  ☆59Updated 6 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆55Updated 5 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• THUBear-wjy / LogGrep
  Open-source repository for paper "LogGrep: Fast and Cheap Cloud Log Storage by Exploiting both Static and Runtime Patterns"(ACM Eurosys 2…
  ☆26Updated 2 years ago
• naivewong / heracles
  ☆17Updated 4 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• RedisBloom / t-digest-c
  Wicked Fast, Accurate Quantiles Using 'T-Digests'
  ☆21Updated this week
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 6 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 8 months ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 months ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆19Updated 7 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• NetApp / zufs-zuf
  zero-copy file-system feeder. A Linux module which dispatch kernel’s VFS commands to user-space server.
  ☆61Updated 5 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• naivewong / timeunion
  ☆12Updated 3 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• panagiotisl / chimp
  Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
  ☆38Updated last year
• Spatio-Temporal-Lab / elf
  ☆44Updated last year