Popular repositories Loading
Repositories
Showing 10 of 77 repositories
- bliss_benchmark Public
A benchmark for different indexing data structures to evaluate their performance while varying the sortedness of incoming data.
BU-DiSC/bliss_benchmark’s past year of commit activity - ACE-codebase Public
BU-DiSC/ACE-codebase’s past year of commit activity - sware Public
The Sortedness Aware Paradigm (SWARE) is a framework that allows to create sortedness-aware counterpart of any tree-based index. The framework enables the index to support faster ingestion through an in-memory buffer.
BU-DiSC/sware’s past year of commit activity - quick-insertion-tree Public
Quick Insertion Tree (QuIT) is a drop-in replacement for B+trees that supports faster ingestion by exploiting incoming data sortedness with no read penalty.
BU-DiSC/quick-insertion-tree’s past year of commit activity - mendeley-library Public
BU-DiSC/mendeley-library’s past year of commit activity - cs660-Spring2025-pa Public
BU-DiSC/cs660-Spring2025-pa’s past year of commit activity - sortedness-demo Public
BU-DiSC/sortedness-demo’s past year of commit activity