Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps
Ayush Dubey, Greg D. Hill, Robert Escriva, Emin G\"un Sirer

TL;DR
Weaver is a high-performance distributed graph database that achieves strict serializable transactions and scalability using refinable timestamps, enabling faster and more consistent graph analysis.
Contribution
We introduce refinable timestamps, a novel request ordering mechanism that combines vector timestamps with a timeline oracle to ensure strong consistency efficiently.
Findings
8x faster Bitcoin blockchain explorer than Blockchain.info
12x higher throughput than Titan on social workloads
4x lower latency than GraphLab on offline graph traversal
Abstract
Graph databases have become an increasingly common infrastructure component. Yet existing systems either operate on offline snapshots, provide weak consistency guarantees, or use expensive concurrency control techniques that limit performance. In this paper, we introduce a new distributed graph database, called Weaver, which enables efficient, transactional graph analyses as well as strictly serializable ACID transactions on dynamic graphs. The key insight that allows Weaver to combine strict serializability with horizontal scalability and high performance is a novel request ordering mechanism called refinable timestamps. This technique couples coarse-grained vector timestamps with a fine-grained timeline oracle to pay the overhead of strong consistency only when needed. Experiments show that Weaver enables a Bitcoin blockchain explorer that is 8x faster than Blockchain.info, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
