Pith. sign in

REVIEW

A1: A Distributed In-Memory Graph Database

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.05712 v1 pith:MGWU37KI submitted 2020-04-12 cs.DB cs.DC

Chiranjeeb Buragohain , Knut Magne Risvik , Paul Brett , Miguel Castro , Wonhee Cho , Joshua Cowhig , Nikolas Gloy , Karthik Kalyanaraman
show 6 more authors
Richendra Khanna John Pao Matthew Renzelmann Alex Shamis Timothy Tan Shuheng Zheng
This is my paper · ORCID
classification cs.DBcs.DC
keywords datadistributedin-memoryqueryrdmaaccessdatabaseengine
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A1 is an in-memory distributed database used by the Bing search engine to support complex queries over structured data. The key enablers for A1 are availability of cheap DRAM and high speed RDMA (Remote Direct Memory Access) networking in commodity hardware. A1 uses FaRM as its underlying storage layer and builds the graph abstraction and query engine on top. The combination of in-memory storage and RDMA access requires rethinking how data is allocated, organized and queried in a large distributed system. A single A1 cluster can store tens of billions of vertices and edges and support a throughput of 350+ million of vertex reads per second with end to end query latency in single digit milliseconds. In this paper we describe the A1 data model, RDMA optimized data structures and query execution.

Discussion (0). Continue with ORCID to comment.

Pith tools