A1: A Distributed In-Memory Graph Database
Autor: | Alex Shamis, Chiranjeeb Buragohain, Nikolas Gloy, Timothy Tan, Paul Brett, Karthik Kalyanaraman, John Pao, Knut Magne Risvik, Wonhee Cho, Shuheng Zheng, Joshua Allen Cowhig, Miguel Castro, Matthew Renzelmann, Richendra Khanna |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2020 |
Předmět: |
FOS: Computer and information sciences
Graph database Remote direct memory access Hardware_MEMORYSTRUCTURES Distributed database Computer science business.industry Databases (cs.DB) 020206 networking & telecommunications 02 engineering and technology computer.software_genre Data structure Search engine In-memory database Data model Computer Science - Databases Computer Science - Distributed Parallel and Cluster Computing 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Distributed Parallel and Cluster Computing (cs.DC) business computer Computer network |
Zdroj: | SIGMOD Conference |
Popis: | 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 [11,12] 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. |
Databáze: | OpenAIRE |
Externí odkaz: |
načítá se...