2 papers
cs.DC2025
Bridging Cache-Friendliness and Concurrency: A Locality-Optimized In-Memory B-Skiplist
Yicong Luo, Senhe Hao, Brian Wheatman +2
Skiplists are widely used for in-memory indexing in many key-value stores, such as RocksDB and LevelDB, due to their ease of implementation and simple concurrency control mechanism…
cs.DS2024
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
Brian Wheatman, Xiaojun Dong, Zheqi Shen +4
A fundamental building block in any graph algorithm is a graph container - a data structure used to represent the graph. Ideally, a graph container enables efficient access to the…