Alternatives and similar repositories for BC-Tree

Users that are interested in BC-Tree are comparing it to the libraries listed below

• wheatman / BP-Tree
  ☆16Updated 11 months ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆15Updated last year
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 5 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 9 months ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated last month
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆90Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 6 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 9 months ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆83Updated 3 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• gaurav16gupta / constrainedANN
  ☆14Updated 11 months ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 5 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆26Updated 4 months ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• AutomataLab / JSONSki
  JSONPath Streaming with Bit-Parallel Fast-Forwarding
  ☆33Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago