Alternatives and similar repositories for briskstream

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

• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 4 years ago
• sfu-dis / ssd-vs-pm
  Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
  ☆36Updated 3 years ago
• wheatman / BP-Tree
  ☆15Updated 9 months ago
• resource-disaggregation / snowset
  Snowflake dataset containing statistics for 70 million queries over 14 day period
  ☆115Updated 4 years ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• intellistream / AllianceDB
  ☆16Updated 7 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• yaobaiwei / GTran
  A high-performance distributed graph database based on RDMA.
  ☆17Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• psiul / ICDE2019-GPU-Join
  Implementation of the algorithm described in "Hardware-conscious Hash-Joins on GPUs" paper presented in ICDE 2019
  ☆34Updated 5 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 5 years ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• iotlpf / FINEdex
  FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems
  ☆34Updated 3 years ago
• hpides / pmem-olap
  This repository contains the source code for our ACM SIGMOD '21 paper (Maximizing Persistent Memory Bandwidth Utilization for OLAP Worklo…
  ☆21Updated 3 years ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆27Updated 2 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆45Updated 4 months ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆39Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• anilshanbhag / crystal
  GPU library for writing SQL queries
  ☆79Updated last year
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• derFischer / Polyjuice
  ☆35Updated 8 months ago
• eniac / TELEPORT
  Optimizing data-intensive systems in disaggregated data centers
  ☆13Updated 3 years ago
• rstream-system / RStream
  ☆25Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆48Updated 2 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• thustorage / Sherman
  Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
  ☆110Updated last year
• xiangyuzhi / GraphStorageExp
  ☆12Updated last year