pith. sign in

arxiv: 2606.04813 · v1 · pith:EJ5EZ3WCnew · submitted 2026-06-03 · 💻 cs.DB · cs.PL

GraphAlg Playground: An Online Platform for Learning and Experimenting with the GraphAlg Language

Daan de Graaf , Robert Brijder , Soham Chakraborty , George Fletcher , Bram van de Wall , Nikolay Yakovets This is my paper

Pith reviewed 2026-06-28 03:50 UTC · model grok-4.3

classification 💻 cs.DB cs.PL
keywords GraphAlggraph algorithmsdatabaseplaygroundweb-based tooluser-defined analyticsinteractive tutorial
0
0 comments X

The pith

GraphAlg language provides native support for user-defined graph analytics workloads in databases through a browser-based playground.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a web-based playground for the GraphAlg language that lets users write and run graph algorithm programs directly in the browser. The playground includes an interactive tutorial on key concepts and requires no installation. It is released as a reusable library under a permissive license. New users follow the tutorial to learn the language while expert users prototype and validate algorithms on the site. The work positions this setup as evidence that GraphAlg can bring custom graph analytics workloads into databases natively.

Core claim

The GraphAlg language for graph algorithms enables native support for user-defined graph analytics workloads in databases, demonstrated by a freely available web-based playground that executes programs inside the browser and supplies an interactive tutorial for its concepts.

What carries the argument

The GraphAlg language, carried by a browser-executable playground and interactive tutorial that allow writing, running, and learning graph algorithm programs without external setup.

If this is right

  • New users can learn GraphAlg programming solely through the browser tutorial.
  • Expert users can prototype and validate custom graph algorithms directly in the browser.
  • The playground serves as a reusable library that other projects can embed without installation steps.
  • Two public demonstration scenarios illustrate learning for beginners and validation for experts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Widespread use of the playground could accelerate adoption of custom graph workloads in existing database systems.
  • Browser execution opens the possibility of sharing runnable GraphAlg snippets across teams without environment mismatches.
  • If GraphAlg integrates as described, database vendors might expose similar user-defined analytics interfaces without heavy client-side tooling.

Load-bearing premise

That the GraphAlg language actually supplies native support for user-defined graph analytics workloads inside databases.

What would settle it

A concrete test showing that GraphAlg programs require external components or cannot execute inside a standard database engine without the playground wrapper.

Figures

Figures reproduced from arXiv: 2606.04813 by Bram van de Wall, Daan de Graaf, George Fletcher, Nikolay Yakovets, Robert Brijder, Soham Chakraborty.

Figure 1
Figure 1. Figure 1: A GraphAlg program in the playground. according to their expressive power and the scope of automated optimization. GraphAlg [3] is a domain-specific language for graph algo￾rithms, based on linear algebra, that addresses this gap. GraphAlg satisfies four critical requirements: (1) Expressive: users implement arbitrary algorithms by composing matrix operations; (2) Designed for graph algorithms: programs re… view at source ↗
Figure 3
Figure 3. Figure 3: Overview of the GraphAlg Playground Architec￾ture. Our demonstration consists of two scenarios: (1) Using the play￾ground as an experienced GraphAlg programmer to modify and test an algorithm, and (2) Working through the tutorial as a devel￾oper new to GraphAlg. 2 GRAPHALG IN A NUTSHELL GraphAlg is a domain-specific language for graph algorithms based on linear algebra. Matrix operations naturally express … view at source ↗
Figure 2
Figure 2. Figure 2: Existing approaches to in-database graph analytics [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: An error diagnostic in the code editor, generated by [PITH_FULL_IMAGE:figures/full_fig_p003_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Alex uploads a file containing a small graph to the [PITH_FULL_IMAGE:figures/full_fig_p003_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Alex executes the PageRank algorithm on the large [PITH_FULL_IMAGE:figures/full_fig_p004_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A section of the GraphAlg tutorial with an inter￾active code snippet and a suggested experiment. . REFERENCES [1] Robert Brijder, Floris Geerts, Jan Van Den Bussche, and Timmy Weerwag. 2019. On the Expressive Power of Query Languages for Matrices. ACM Trans. Database Syst. 44, 4 (Oct. 2019), 15:1–15:31. https://doi.org/10.1145/3331445 [2] Daan de Graaf. 2026. wildarch/graphalg. https://github.com/wildarch/… view at source ↗
read the original abstract

The GraphAlg language for graph algorithms enables native support for user-defined graph analytics workloads in databases. In this demonstration, we present a web-based playground for writing and executing GraphAlg programs in the web browser, including an interactive tutorial explaining its key concepts. The playground runs inside the user's web browser without any installation, and is freely available under a permissive license as a reusable library. We present two demonstration scenarios of the publicly available playground website, showing how new users can learn to program in GraphAlg using the tutorial, while expert users can use the playground to prototype and validate their algorithms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript claims that the GraphAlg language enables native support for user-defined graph analytics workloads in databases. It presents a web-based playground for writing and executing GraphAlg programs directly in the browser (no installation required), including an interactive tutorial on key concepts, and describes two demonstration scenarios for learning the language and prototyping algorithms. The playground is released as a freely available reusable library under a permissive license.

Significance. If the native database integration claim holds, the work could contribute to making graph analytics more accessible within database systems by supporting user-defined workloads. The playground component provides practical educational value as a zero-install tool for teaching and experimenting with graph algorithms, which may benefit database education and rapid prototyping.

major comments (1)
  1. [Abstract] Abstract: The central premise that 'The GraphAlg language for graph algorithms enables native support for user-defined graph analytics workloads in databases' is stated without any accompanying description of the embedding mechanism, execution engine integration, architecture, or empirical validation. The manuscript provides only a description of the browser-based playground and tutorial scenarios, leaving the native support claim as an unsupported assertion rather than a demonstrated result.
minor comments (1)
  1. The manuscript would benefit from explicit separation between claims about the GraphAlg language's database capabilities and the features of the presented playground tool.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the review and the recommendation for major revision. The manuscript is a demonstration paper whose primary contribution is the publicly available GraphAlg Playground and its tutorial. We address the single major comment below.

read point-by-point responses

  1. Referee: The central premise that 'The GraphAlg language for graph algorithms enables native support for user-defined graph analytics workloads in databases' is stated without any accompanying description of the embedding mechanism, execution engine integration, architecture, or empirical validation. The manuscript provides only a description of the browser-based playground and tutorial scenarios, leaving the native support claim as an unsupported assertion rather than a demonstrated result.

    Authors: We agree with the observation. The opening sentence of the abstract asserts a property of the GraphAlg language that is not demonstrated or described in this manuscript; the paper is limited to the browser-based playground, tutorial, and two usage scenarios. This manuscript does not contain the embedding mechanism, execution engine details, architecture, or validation that would be required to substantiate the native-support claim. We will revise the abstract (and, if needed, the introduction) to remove or qualify the unsupported claim and to state the paper's actual scope as a demonstration of the playground tool. revision: yes

Circularity Check

0 steps flagged

No significant circularity; paper is a tool demonstration without derivations

full rationale

The manuscript is a demonstration paper describing a browser-based playground for the GraphAlg language, including a tutorial and usage scenarios. The opening sentence states that GraphAlg 'enables native support for user-defined graph analytics workloads in databases' as a premise motivating the playground, but no equations, derivation steps, fitted parameters, or self-citations appear in the abstract or demo description. No load-bearing claim reduces by construction to its own inputs, and the content contains no mathematical or logical chain that could be inspected for circularity. The paper is self-contained as a software tool description.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a software demonstration paper. No mathematical derivations, fitted parameters, background axioms, or new postulated entities are introduced in the abstract.

pith-pipeline@v0.9.1-grok · 5641 in / 892 out tokens · 41606 ms · 2026-06-28T03:50:45.380472+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 14 canonical work pages

  1. [1]

    Robert Brijder, Floris Geerts, Jan Van Den Bussche, and Timmy Weerwag. 2019. On the Expressive Power of Query Languages for Matrices.ACM Trans. Database Syst.44, 4 (Oct. 2019), 15:1–15:31. https://doi.org/10.1145/3331445

    work page doi:10.1145/3331445 2019

  2. [2]

    Daan de Graaf. 2026. wildarch/graphalg. https://github.com/wildarch/graphalg original-date: 2025-10-09T14:03:07Z

    2026

  3. [3]

    Daan de Graaf, Robert Brijder, Soham Chakraborty, George Fletcher, Bram van de Wall, and Nikolay Yakovets. 2026. Algorithm Support for Graph Databases, Done Right. https://doi.org/10.48550/arXiv.2601.06705 arXiv:2601.06705 [cs]

    work page doi:10.48550/arxiv.2601.06705 2026

  4. [4]

    Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lin- daaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, and Andrés Taylor. 2018. Cypher: An Evolving Query Language for Property Graphs. InProceedings of the 2018 International Conference on Management of Data (SIG- MOD ’18). Association for Computing Machinery, Ne...

    work page doi:10.1145/3183713.3190657 2018

  5. [5]

    Google Inc. [n.d.]. Go Playground - The Go Programming Language. https: //go.dev/play/

  6. [6]

    Surabhi Gupta and Karthik Ramachandra. 2021. Procedural extensions of SQL: understanding their usage in the wild.Proceedings of the VLDB Endowment14, 8 (April 2021), 1378–1391. https://doi.org/10.14778/3457390.3457402

    work page doi:10.14778/3457390.3457402 2021

  7. [7]

    Oleg Kiselyov and Hiromi Ishii

    Andreas Haas, Andreas Rossberg, Derek L. Schuff, Ben L. Titzer, Michael Holman, Dan Gohman, Luke Wagner, Alon Zakai, and JF Bastien. 2017. Bringing the web up to speed with WebAssembly. InProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2017). Association for Computing Machinery, New York, NY, USA, 185...

    work page doi:10.1145/3062341.3062363 2017

  8. [8]

    Denis Hirn and Torsten Grust. 2023. A Fix for the Fixation on Fixpoints. In Proceedings of the 13th Conference on Innovative Data Systems Research

    2023

  9. [9]

    Reutter, and Adrián Soto

    Aidan Hogan, Juan L. Reutter, and Adrián Soto. 2020. In-Database Graph An- alytics with Recursive SPARQL. InThe Semantic Web – ISWC 2020, Jeff Z. Pan, Valentina Tamma, Claudia d’Amato, Krzysztof Janowicz, Bo Fu, Axel Polleres, Oshani Seneviratne, and Lalana Kagal (Eds.). Springer International Publishing, Cham, 511–528. https://doi.org/10.1007/978-3-030-6...

    work page doi:10.1007/978-3-030-62419-4_29 2020

  10. [10]

    Dylan Hutchison, Bill Howe, and Dan Suciu. 2017. LaraDB: A Minimalist Kernel for Linear and Relational Algebra Computation. InProceedings of the 4th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond. 1–10. https://doi.org/10.1145/3070607.3070608 arXiv:1703.07342 [cs]

    work page doi:10.1145/3070607.3070608 2017

  11. [11]

    Alexandru Iosup, Tim Hegeman, Wing Lung Ngai, Stijn Heldens, Arnau Prat- Pérez, Thomas Manhardt, Hassan Chafi, Mihai Capotă, Narayanan Sundaram, Michael Anderson, Ilie Gabriel Tănase, Yinglong Xia, Lifeng Nai, and Peter Boncz

  12. [12]

    2016), 1317–1328

    LDBC graphalytics: a benchmark for large-scale graph analysis on parallel and distributed platforms.Proceedings of the VLDB Endowment9, 13 (Sept. 2016), 1317–1328. https://doi.org/10.14778/3007263.3007270

    work page doi:10.14778/3007263.3007270 2016

  13. [13]

    ISO. 2024. Information technology — Database languages — GQL. https: //www.iso.org/standard/76120.html

    2024

  14. [14]

    2011.Graph Algorithms in the Language of Linear Algebra

    Jeremy Kepner and John Gilbert (Eds.). 2011.Graph Algorithms in the Language of Linear Algebra. Society for Industrial and Applied Mathematics. https: //doi.org/10.1137/1.9780898719918

    work page doi:10.1137/1.9780898719918 2011

  15. [15]

    Hongbin Ma, Bin Shao, Yanghua Xiao, Liang Jeff Chen, and Haixun Wang. 2016. G-SQL: fast query processing via graph exploration.Proceedings of the VLDB Endowment9, 12 (Aug. 2016), 900–911. https://doi.org/10.14778/2994509.2994510

    work page doi:10.14778/2994509.2994510 2016

  16. [16]

    Neo4J inc. [n.d.]. Graph algorithms - Neo4j Graph Data Science. https://neo4j. com/docs/graph-data-science/2.17/algorithms/

  17. [17]

    Amir Shaikhha, Dan Suciu, Maximilian Schleich, and Hung Q. Ngo. 2024. Opti- mizing Nested Recursive Queries.Proc. ACM Manag. Data2, 1 (2024), 16:1–16:27. https://doi.org/10.1145/3639271

    work page doi:10.1145/3639271 2024

  18. [18]

    Alexander Shkapsky, Mohan Yang, and Carlo Zaniolo. 2015. Optimizing recursive queries with monotonic aggregates in DeALS. In2015 IEEE 31st International Conference on Data Engineering. 867–878. https://doi.org/10.1109/ICDE.2015. 7113340 ISSN: 2375-026X

    work page doi:10.1109/icde.2015 2015

  19. [19]

    Moritz Sichert and Thomas Neumann. 2022. User-defined operators: efficiently in- tegrating custom algorithms into modern databases.Proceedings of the VLDB En- dowment15, 5 (Jan. 2022), 1119–1131. https://doi.org/10.14778/3510397.3510408

    work page doi:10.14778/3510397.3510408 2022

  20. [20]

    The DuckDB Developers. [n.d.]. DuckDB Web Shell. https://shell.duckdb.org/

  21. [21]

    The Rust Developers. [n.d.]. Rust Playground. https://play.rust-lang.org/

  22. [22]

    The Umbra Developers. [n.d.]. Umbra Online Interface. https://umbra-db.com/ interface

  23. [23]

    Wilco van Leeuwen, Thomas Mulder, Bram van de Wall, George Fletcher, and Nikolay Yakovets. 2022. AvantGraph query processing engine.Proceedings of the VLDB Endowment15, 12 (Aug. 2022), 3698–3701. https://doi.org/10.14778/ 3554821.3554878 4

    work page arXiv 2022