{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:54:32Z","timestamp":1773482072416,"version":"3.50.1"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>We demonstrate the most important new feature of SQL:2023, namely SQL\/PGQ, which eases querying graphs using SQL by introducing new syntax for pattern matching and (shortest) path-finding. We show how support for SQL\/PGQ can be integrated into an RDBMS, specifically in the DuckDB system, using an extension module called DuckPGQ. As such, we also demonstrate the use of the DuckDB extensibility mechanism, which allows us to add new functions, data types, operators, optimizer rules, storage systems, and even parsers to DuckDB. We also describe the new data structures and algorithms that the DuckPGQ module is based on, and how they are injected into SQL plans.<\/jats:p>\n          <jats:p>While the demonstrated DuckPGQ extension module is lean and efficient, we sketch a roadmap to (i) improve its performance through new algorithms (factorized and WCOJ) and better parallelism and (ii) extend its functionality to scenarios beyond SQL, e.g., building and analyzing Graph Neural Networks.<\/jats:p>","DOI":"10.14778\/3611540.3611614","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:32:37Z","timestamp":1694777557000},"page":"4034-4037","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["DuckPGQ: Bringing SQL\/PGQ to DuckDB"],"prefix":"10.14778","volume":"16","author":[{"given":"Daniel ten","family":"Wolde","sequence":"first","affiliation":[{"name":"CWI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Sz\u00e1rnyas","sequence":"additional","affiliation":[{"name":"CWI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000024"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Renzo Angles et al. 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. (2017).","DOI":"10.1145\/3104031"},{"key":"e_1_2_1_3_1","volume-title":"G-CORE: A Core for Future Graph Query Languages. In SIGMOD","author":"Renzo","year":"2018","unstructured":"Renzo Angles et al. 2018. G-CORE: A Core for Future Graph Query Languages. In SIGMOD 2018."},{"key":"e_1_2_1_4_1","volume-title":"PG-Keys: Keys for Property Graphs. In SIGMOD","author":"Renzo","year":"2021","unstructured":"Renzo Angles et al. 2021. PG-Keys: Keys for Property Graphs. In SIGMOD 2021."},{"key":"e_1_2_1_5_1","unstructured":"Maciej Besta et al. 2019. Demystifying Graph Databases: Analysis and Taxonomy of Data Organization System Designs and Graph Queries. CoRR (2019)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407851"},{"key":"e_1_2_1_7_1","volume-title":"Graph Pattern Matching in GQL and SQL\/PGQ. In SIGMOD","author":"Alin","year":"2022","unstructured":"Alin Deutsch et al. 2022. Graph Pattern Matching in GQL and SQL\/PGQ. In SIGMOD 2022."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Till D\u00f6hmen et al. 2017. Multi-Hypothesis CSV Parsing. In SSDBM.","DOI":"10.1145\/3085504.3085520"},{"key":"e_1_2_1_9_1","volume-title":"LDBC Social Network Benchmark: Interactive Workload. In SIGMOD","author":"Orri","year":"2015","unstructured":"Orri Erling et al. 2015. LDBC Social Network Benchmark: Interactive Workload. In SIGMOD 2015."},{"key":"e_1_2_1_10_1","volume-title":"ICDT","author":"Nadime","year":"2023","unstructured":"Nadime Francis et al. 2023. A Researcher's Digest of GQL (Invited Talk). In ICDT 2023."},{"key":"e_1_2_1_11_1","volume-title":"Freitag and Thomas Neumann","author":"Michael","year":"2019","unstructured":"Michael J. Freitag and Thomas Neumann. 2019. Every Row Counts: Combining Sketches and Sampling for Accurate Group-By Result Estimates. In CIDR 2019."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Per Fuchs et al. 2020. EdgeFrame: Worst-Case Optimal Joins for Graph-Pattern Matching in Spark. In GRADES-NDA at SIGMOD 2020.","DOI":"10.1145\/3398682.3399162"},{"key":"e_1_2_1_13_1","volume-title":"Semi-Supervised Classification with Graph Convolutional Networks. In ICLR","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR 2017."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 Kohn et al. 2022. DuckDB-Wasm: Fast Analytical Processing for the Web. PVLDB 15 12 (2022).","DOI":"10.14778\/3554821.3554847"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00159"},{"key":"e_1_2_1_16_1","volume-title":"SIGMOD","author":"Viktor","year":"2014","unstructured":"Viktor Leis et al. 2014. Morsel-driven parallelism: A NUMA-aware query evaluation framework for the many-core age. In SIGMOD 2014."},{"key":"e_1_2_1_17_1","first-page":"1058","article-title":"Efficient Processing of Window Functions in Analytical SQL Queries","volume":"8","author":"Viktor Leis","year":"2015","unstructured":"Viktor Leis et al. 2015. Efficient Processing of Window Functions in Analytical SQL Queries. PVLDB 8, 10 (2015), 1058--1069.","journal-title":"PVLDB"},{"key":"e_1_2_1_18_1","volume-title":"Chimp: Efficient Lossless Floating Point Compression for Time Series Databases. PVLDB","author":"Panagiotis Liakos","year":"2022","unstructured":"Panagiotis Liakos et al. 2022. Chimp: Efficient Lossless Floating Point Compression for Time Series Databases. PVLDB (2022)."},{"key":"e_1_2_1_19_1","volume-title":"Unnesting Arbitrary Queries. In BTW 2015 (LNI)","volume":"241","author":"Neumann Thomas","year":"2015","unstructured":"Thomas Neumann and Alfons Kemper. 2015. Unnesting Arbitrary Queries. In BTW 2015 (LNI), Vol. P-241. GI, 383--402."},{"key":"e_1_2_1_20_1","volume-title":"Adaptive Optimization of Very Large Join Queries. In SIGMOD","author":"Neumann Thomas","year":"2018","unstructured":"Thomas Neumann and Bernhard Radke. 2018. Adaptive Optimization of Very Large Join Queries. In SIGMOD 2018."},{"key":"e_1_2_1_21_1","unstructured":"Adam Paszke et al. 2019. PyTorch: An Imperative Style High-Performance Deep Learning Library. CoRR abs\/1912.01703 (2019)."},{"key":"e_1_2_1_22_1","first-page":"3372","article-title":"Velox: Meta's Unified Execution Engine","volume":"15","author":"Pedro Pedreira","year":"2022","unstructured":"Pedro Pedreira et al. 2022. Velox: Meta's Unified Execution Engine. PVLDB 15, 12 (2022), 3372--3384.","journal-title":"PVLDB"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320212"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"G\u00e1bor Sz\u00e1rnyas et al. 2022. The LDBC Social Network Benchmark: Business Intelligence Workload. PVLDB (2022).","DOI":"10.14778\/3574245.3574270"},{"key":"e_1_2_1_25_1","volume-title":"CIDR","author":"Daniel","year":"2023","unstructured":"Daniel ten Wolde et al. 2023. DuckPGQ: Efficient property graph queries in an analytical RDBMS. In CIDR 2023."},{"key":"e_1_2_1_26_1","volume-title":"Merrier: Efficient Multi-Source Graph Traversal. PVLDB","author":"Manuel Then","year":"2014","unstructured":"Manuel Then et al. 2014. The More the Merrier: Efficient Multi-Source Graph Traversal. PVLDB (2014)."},{"key":"e_1_2_1_27_1","volume-title":"SuperScalar RAM-CPU Cache Compression. In ICDE","author":"Zukowski Marcin","year":"2006","unstructured":"Marcin Zukowski, S\u00e1ndor H\u00e9man, Niels Nes, and Peter A. Boncz. 2006. SuperScalar RAM-CPU Cache Compression. In ICDE 2006."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3611540.3611614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:35:14Z","timestamp":1757543714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3611540.3611614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":27,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.14778\/3611540.3611614"],"URL":"https:\/\/doi.org\/10.14778\/3611540.3611614","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"2023-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}