Alternatives and similar repositories for MonetDBLite-C:

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

• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• Mytherin / RembranDB
  Sample database with LLVM execution engine.
  ☆11Updated 8 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• spirom / arrow-simpledb
  Query processing for an extremely simple, in-memory, columnar database using Apache Arrow to represent tables
  ☆22Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆45Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 3 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 4 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 3 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆15Updated 4 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated 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
• graindb / graindb
  ☆19Updated 3 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 10 months ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 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.
  ☆41Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 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 last year
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆68Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago