Alternatives and similar repositories for MonetDBLite-C:

Users that are interested in MonetDBLite-C are comparing it to the libraries listed below

• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 3 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• MicrosoftResearch / NaiadSamples
  Sample implementations using Naiad
  ☆38Updated 10 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• jasonge27 / fastQuantile
  Memory Efficient Quantile Approximator for High Speed Data Streams
  ☆21Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 10 months 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.
  ☆40Updated 8 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆44Updated 2 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 9 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• Mytherin / RembranDB
  Sample database with LLVM execution engine.
  ☆11Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• sears / mapkeeper
  Thrift based key-value store with various storage backends, including MySQL, Berkeley DB, and LevelDB.
  ☆15Updated 12 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆71Updated 3 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 6 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 4 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆61Updated 3 years ago