MonetDB / MonetDBLite-C

Related projects ⓘ

Alternatives and complementary repositories for MonetDBLite-C

• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 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 7 months ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆38Updated 9 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆103Updated 7 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 4 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated last year
• spirom / arrow-simpledb
  Query processing for an extremely simple, in-memory, columnar database using Apache Arrow to represent tables
  ☆22Updated 3 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆12Updated 3 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆45Updated 8 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• sears / mapkeeper
  Thrift based key-value store with various storage backends, including MySQL, Berkeley DB, and LevelDB.
  ☆15Updated 12 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 9 months ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 3 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆29Updated 6 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆50Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆126Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 2 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 4 years ago