Time: Tuesday, 17 January 2017, 9:30am
Venue: Lecture Hall, B Block, 03rd Floor, Dept. of CSE, Kanwal Rekhi (KReSIT) Bldg.
Graph databases have become a common infrastructure component. Yet existing systems either operate on offline snapshots, provide weak consistency guarantees, or use expensive concurrency control techniques that limit performance. This talk introduces 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 8× faster than Blockchain.info , and achieves 10.9× higher throughput than the Titan graph database on social network workloads and 4× lower latency than GraphLab on offline graph traversal workloads.
Ayush Dubey is a PhD candidate in the Computer Science department at Cornell University advised by Emin Gün Sirer. He is broadly interested in distributed systems and databases, and his current projects focus on distributed event ordering, graph databases, and approximate big data computing.
More details about Ayush Dubey are available at http://ayushdubey.com/