TAOBench

Abstract

The continued emergence of large social network applications has introduced a scale of data and query volume that challenges the limits of existing data stores. However, few benchmarks accurately simulate these request patterns, leaving researchers in short supply of tools to evaluate and improve upon these systems. In this paper, we present a new benchmark, TAOBench, that captures the social graph workload at Meta. We open source workload configurations along with a benchmark that leverages these request features to both accurately model production workloads and generate emergent application behavior. We ensure the integrity of TAOBench's workloads by validating them against their production counterparts. We also describe several benchmark use cases at Meta and report results for five popular distributed database systems to demonstrate the benefits of using TAOBench to evaluate system tradeoffs as well as identify and address performance issues. Our benchmark fills a gap in the available tools and data that researchers and developers have to inform system design decisions.

NOC-NOC: Towards Performance-optimal Distributed Transactions

“…However, a recent study reveals that TPC-C, essentially as an I/O benchmark, may not be ideal for benchmarking concurrency control algorithms [50]. We could therefore consider benchmarks with realistic workloads (e.g., highlyskewed transactions [11]) which are also suitable for concurrency control, or even design new ones, e.g., by creating hot warehouses in TPC-C with YCSB's Zipfian or hotspot distribution [50]. Ultimately, we could use realistic transaction workloads collected from production systems.…”