Alternatives and similar repositories for Pison

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

• AutomataLab / JSONSki
  JSONPath Streaming with Bit-Parallel Fast-Forwarding
  ☆33Updated last year
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆28Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• AutomataLab / JPStream
  JPStream: JSONPath Stream Processing in Parallel
  ☆25Updated 3 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 6 years ago
• DBOS-project / dbos-scheduler
  ☆28Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• tuhhosg / exmap
  ☆50Updated last year
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• Trinity-data-store / Trinity
  EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"
  ☆19Updated 10 months ago
• viktorleis / vmcache
  ☆81Updated 4 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• wheatman / BP-Tree
  ☆16Updated last year
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 5 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• owensgroup / GpuBTree
  Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019
  ☆58Updated 3 years ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆76Updated last month
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆26Updated last year
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆84Updated 3 years ago