research-article

AvantGraph query processing engine

Authors:

Wilco v. Leeuwen,

Bram van de Wall,

George Fletcher,

Nikolay YakovetsAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 15, Issue 12

Pages 3698 - 3701

https://doi.org/10.14778/3554821.3554878

Published: 01 August 2022 Publication History

Abstract

We demonstrate AvantGraph, a graph query processing engine developed by the Database group at TU Eindhoven. Designed for efficient processing of both subgraph matching and navigational graph queries, AvantGraph encompasses innovation in three key areas: the planner, the cardinality estimator, and the execution engine. We present demonstration scenarios covering a wide range of workloads across diverse domains which (1) provides deep insights into the core challenges of complex graph query processing and (2) showcases corresponding critical optimizations via "under-the-hood" operational insights of AvantGraph's key components.

References

[1]

Zahid Abul-Basher, Nikolay Yakovets, Parke Godfrey, Stanley Clark, and Mark Chignell. 2021. Answer graph: Factorization matters in large graphs. In Proceedings of the 24th International Conference on Extending Database Technology.

[2]

Renzo Angles. 2018. The Property Graph Database Model. In AMW.

[3]

R Angles, M Arenas, P Barceló, P Boncz, G Fletcher, C Gutierrez, T Lindaaker, M Paradies, S Plantikow, J Sequeda, et al. 2018. G-CORE: A core for future graph query languages. In SIGMOD.

[4]

Diego Arroyuelo, Aidan Hogan, Gonzalo Navarro, Juan L Reutter, Javiel Rojas-Ledesma, and Adrián Soto. 2021. Worst-case optimal graph joins in almost no space. In Proceedings of the 2021 International Conference on Management of Data.

Digital Library

[5]

Angela Bonifati, George Fletcher, Hannes Voigt, and Nikolay Yakovets. 2018. Querying graphs. Synthesis Lectures on Data Management 10, 3 (2018), 1--184.

[6]

Angela Bonifati, Wim Martens, and Thomas Timm. 2020. An analytical study of large SPARQL query logs. VLDB J. 29, 2--3 (2020), 655--679.

[7]

Nieves R Brisaboa, Ana Cerdeira-Pena, Guillermo de Bernardo, and Gonzalo Navarro. 2017. Compressed representation of dynamic binary relations with applications. Information Systems 69 (2017), 106--123.

[8]

Michael Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, and Thomas Neumann. 2020. Adopting worst-case optimal joins in relational database systems. Proceedings of the VLDB Endowment 13, 12 (2020), 1891--1904.

Digital Library

[9]

L Jachiet, P Genevès, N Gesbert, and N Layaïda. 2020. On the optimization of recursive relational queries: Application to graph queries. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 681--697.

Digital Library

[10]

A.O. Mendelzon and P.T. Wood. 1995. Finding regular simple paths in graph databases. SIAM J. Comput. 24, 6 (1995), 1235--1258.

Digital Library

[11]

Amine Mhedhbi, Matteo Lissandrini, Laurens Kuiper, Jack Waudby, and Gábor Szárnyas. 2021. LSQB: a large-scale subgraph query benchmark. In Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA). 1--11.

Digital Library

[12]

Thomas Neumann and Michael J Freitag. 2020. Umbra: A Disk-Based System with In-Memory Performance. In CIDR.

[13]

C. Ordonez. 2010. Optimization of linear recursive queries in SQL. Knowledge and Data Engineering, IEEE Transactions on 22, 2 (2010), 264--277.

Digital Library

[14]

J Patel, H Deshmukh, J Zhu, N Potti, Z Zhang, M Spehlmann, H Memisoglu, and S Saurabh. 2018. Quickstep: A data platform based on the scaling-up approach. Proceedings of the VLDB Endowment 11, 6 (2018), 663--676.

Digital Library

[15]

B. van de Wall. 2020. Fully Compiled Execution of Conjunctive Graph Queries. MSc Thesis, TU Eindhoven.

[16]

J. van der Looij. 2021. Avantstep: parallel query execution in graph databases. MSc Thesis, TU Eindhoven.

[17]

Wilco van Leeuwen, George Fletcher, and Nikolay Yakovets. 2022. A General Cardinality Estimation Framework for Subgraph Matching in Property Graphs. Knowledge and Data Engineering, IEEE Transactions on (2022).

[18]

Haoran Xu and Fredrik Kjolstad. 2021. Copy-and-patch compilation: a fast compilation algorithm for high-level languages and bytecode. Proceedings of the ACM on Programming Languages 5, OOPSLA (2021), 1--30.

Digital Library

[19]

Nikolay Yakovets. 2017. Optimization of Regular Path Queries in Graph Databases. PhD Dissertation, York University.

[20]

Nikolay Yakovets, Parke Godfrey, and Jarek Gryz. 2016. Query Planning for Evaluating SPARQL Property Paths. In SIGMOD. San Francisco, 1875--1889.

Digital Library

[21]

Kaijie Zhu, George Fletcher, and Nikolay Yakovets. 2021. Leveraging temporal and topological selectivities in temporal-clique subgraph query processing. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE.

Cited By

van Leeuwen WFletcher GYakovets N(2024)HomeRun: A Cardinality Estimation Advisor for Graph DatabasesProceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3661304.3661902(1-9)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1145/3661304.3661902
Fejza AGenevès PLayaïda NChlyah SFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)The µ-RA System for Recursive Path Queries over GraphsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614756(5041-5045)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3614756
Tian Y(2023)The World of Graph Databases from An Industry PerspectiveACM SIGMOD Record10.1145/3582302.358232051:4(60-67)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1145/3582302.3582320

Index Terms

AvantGraph query processing engine
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Index terms have been assigned to the content through auto-classification.

Recommendations

View-based query processing: On the relationship between rewriting, answering and losslessness

As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
gTop: An Efficient SPARQL Query Engine
Web and Big Data
Abstract
In this demonstration, we present gTop, a top-k query engine based on gStore which supports SPARQL queries over RDF databases. gTop can answer top-k queries with high efficiency and scalability. We use the DP-B algorithm for top-k queries and the ...
A graph query language and its query processing

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 15, Issue 12

August 2022

551 pages

ISSN:2150-8097

Editors:
Fatma Özcan
Google
,
Juliana Freire
New York University
,
Xuemin Lin
University of New South Wales

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 August 2022

Published in PVLDB Volume 15, Issue 12

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
153
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)4

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

van Leeuwen WFletcher GYakovets N(2024)HomeRun: A Cardinality Estimation Advisor for Graph DatabasesProceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3661304.3661902(1-9)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1145/3661304.3661902
Fejza AGenevès PLayaïda NChlyah SFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)The µ-RA System for Recursive Path Queries over GraphsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614756(5041-5045)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3614756
Tian Y(2023)The World of Graph Databases from An Industry PerspectiveACM SIGMOD Record10.1145/3582302.358232051:4(60-67)Online publication date: 25-Jan-2023
https://dl.acm.org/doi/10.1145/3582302.3582320

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents