{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:10:08Z","timestamp":1768108208513,"version":"3.49.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:p>\n            We demonstrate AvantGraph, a graph query processing engine developed by the Database group at TU Eindhoven. Designed for efficient processing of\n            <jats:italic>both<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.14778\/3554821.3554878","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T22:28:39Z","timestamp":1664490519000},"page":"3698-3701","source":"Crossref","is-referenced-by-count":7,"title":["AvantGraph query processing engine"],"prefix":"10.14778","volume":"15","author":[{"given":"Wilco v.","family":"Leeuwen","sequence":"first","affiliation":[{"name":"TU Eindhoven"}]},{"given":"Thomas","family":"Mulder","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}]},{"given":"Bram","family":"van de Wall","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}]},{"given":"George","family":"Fletcher","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}]},{"given":"Nikolay","family":"Yakovets","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 24th International Conference on Extending Database Technology.","author":"Abul-Basher Zahid","year":"2021","unstructured":"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. 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."},{"key":"e_1_2_1_2_1","unstructured":"Renzo Angles. 2018. The Property Graph Database Model.. In AMW.  Renzo Angles. 2018. The Property Graph Database Model.. In AMW."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R Angles M Arenas P Barcel\u00f3 P Boncz G Fletcher C Gutierrez T Lindaaker M Paradies S Plantikow J Sequeda etal 2018. G-CORE: A core for future graph query languages. In SIGMOD.  R Angles M Arenas P Barcel\u00f3 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.","DOI":"10.1145\/3183713.3190654"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457256"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00558-9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.05.003"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407797"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380567"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461837.3464516"},{"key":"e_1_2_1_12_1","volume-title":"Umbra: A Disk-Based System with In-Memory Performance.. In CIDR.","author":"Neumann Thomas","year":"2020","unstructured":"Thomas Neumann and Michael J Freitag . 2020 . Umbra: A Disk-Based System with In-Memory Performance.. In CIDR. Thomas Neumann and Michael J Freitag. 2020. Umbra: A Disk-Based System with In-Memory Performance.. In CIDR."},{"key":"e_1_2_1_13_1","first-page":"264","article-title":"Optimization of linear recursive queries in SQL. Knowledge and Data Engineering","volume":"22","author":"Ordonez C.","year":"2010","unstructured":"C. Ordonez . 2010 . Optimization of linear recursive queries in SQL. Knowledge and Data Engineering , IEEE Transactions on 22 , 2 (2010), 264 -- 277 . C. Ordonez. 2010. Optimization of linear recursive queries in SQL. Knowledge and Data Engineering, IEEE Transactions on 22, 2 (2010), 264--277.","journal-title":"IEEE Transactions on"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3199517.3199518"},{"key":"e_1_2_1_17_1","volume-title":"A General Cardinality Estimation Framework for Subgraph Matching in Property Graphs. Knowledge and Data Engineering","author":"van Leeuwen Wilco","year":"2022","unstructured":"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 ). 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)."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485513"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882944"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00064"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3554821.3554878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:34:45Z","timestamp":1672227285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3554821.3554878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":18,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10.14778\/3554821.3554878"],"URL":"https:\/\/doi.org\/10.14778\/3554821.3554878","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}