https://arxiv.org/abs/2305.11162

Skip to main content
Cornell University
We gratefully acknowledge support from
the Simons Foundation and member institutions.
 
arxiv logo > cs > arXiv:2305.11162
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv logo
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Databases

arXiv:2305.11162 (cs)
[Submitted on 18 May 2023]

Title:High-Performance Graph Databases That Are Portable,
Programmable, and Scale to Hundreds of Thousands of Cores

Authors:Maciej Besta, Robert Gerstenberger, Marc Fischer, Michal
Podstawski, Jurgen Muller, Nils Blach, Berke Egeli, George Mitenkov,
Wojciech Chlapek, Marek Michalewicz, Torsten Hoefler
Download a PDF of the paper titled High-Performance Graph Databases
That Are Portable, Programmable, and Scale to Hundreds of Thousands
of Cores, by Maciej Besta and Robert Gerstenberger and Marc Fischer
and Micha{\l} Podstawski and J\"urgen M\"uller and Nils Blach and
Berke Egeli and George Mitenkov and Wojciech Chlapek and Marek
Michalewicz and Torsten Hoefler
Download PDF

    Abstract: Graph databases (GDBs) are crucial in academic and
    industry applications. The key challenges in developing GDBs are
    achieving high performance, scalability, programmability, and
    portability. To tackle these challenges, we harness established
    practices from the HPC landscape to build a system that
    outperforms all past GDBs presented in the literature by orders
    of magnitude, for both OLTP and OLAP workloads. For this, we
    first identify and crystallize performance-critical building
    blocks in the GDB design, and abstract them into a portable and
    programmable API specification, called the Graph Database
    Interface (GDI), inspired by the best practices of MPI. We then
    use GDI to design a GDB for distributed-memory RDMA
    architectures. Our implementation harnesses one-sided RDMA
    communication and collective operations, and it offers
    architecture-independent theoretical performance guarantees. The
    resulting design achieves extreme scales of more than a hundred
    thousand cores. Our work will facilitate the development of
    next-generation extreme-scale graph databases.

Subjects: Databases (cs.DB); Distributed, Parallel, and Cluster
          Computing (cs.DC)
Cite as:  arXiv:2305.11162 [cs.DB]
          (or arXiv:2305.11162v1 [cs.DB] for this version)
          https://doi.org/10.48550/arXiv.2305.11162
          Focus to learn more
          arXiv-issued DOI via DataCite

Submission history

From: Robert Gerstenberger [view email]
[v1] Thu, 18 May 2023 17:50:32 UTC (677 KB)
Full-text links:

Download:

  * Download a PDF of the paper titled High-Performance Graph
    Databases That Are Portable, Programmable, and Scale to Hundreds
    of Thousands of Cores, by Maciej Besta and Robert Gerstenberger
    and Marc Fischer and Micha{\l} Podstawski and J\"urgen M\"uller
    and Nils Blach and Berke Egeli and George Mitenkov and Wojciech
    Chlapek and Marek Michalewicz and Torsten Hoefler
    PDF
  * Other formats

(license)
Current browse context:
cs.DB
< prev   |   next >
new | recent | 2305
Change to browse by:
cs
cs.DC

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

a export BibTeX citation Loading...

BibTeX formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Mendeley logo Reddit logo ScienceWISE logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
[ ] Litmaps Toggle
Litmaps (What is Litmaps?)
[ ] scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
( ) Code, Data, Media

Code, Data and Media Associated with this Article

[ ] DagsHub Toggle
DagsHub (What is DagsHub?)
[ ] Links to Code Toggle
Papers with Code (What is Papers with Code?)
[ ] ScienceCast Toggle
ScienceCast (What is ScienceCast?)
( ) Demos

Demos

[ ] Replicate Toggle
Replicate (What is Replicate?)
[ ] Spaces Toggle
Hugging Face Spaces (What is Spaces?)
( ) Related Papers

Recommenders and Search Tools

[ ] Link to Influence Flower
Influence Flower (What are Influence Flowers?)
[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)

  * Author
  * Venue
  * Institution
  * Topic

( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack