2026-09-04T07:11:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27588 2026-09-03T08:33:48Z ddc:004 open_access

Logica-TGD: Transforming Graph Databases Logically Skvortsov, Evgeny Xia, Yilin Ludäscher, Bertram Bowers, Shawn Logic rules Graph queries Graph transformations Graph transformations are a powerful computational model for manipulating complex networks, but handling temporal aspects and scalability remain significant challenges. We present a novel approach to implementing graph transformations using Logica, an open-source logic programming language and system that operates over standard database systems including PostgreSQL, DuckDB, and BigQuery. Logica leverages the inherent parallelism of these engines and offers a practical and scalable way to carry out a variety of graph transformations, including complex scenarios such as time-varying graphs. We illustrate Logica’s graph querying and transformation capabilities with several examples, including a declarative program for pathfinding in a dynamic graph and a taxonomic analysis over a full current Wikidata dump. Experimental results compare Logica running on DuckDB engine to the Datalog engines Soufflé and Nemo, and to DuckPGQ, an implementation of SQL/PGQ. We argue that a logic-based declarative syntax, a built-in visualization library, and (plug-and-play) support for large-scale database engines make Logica a convenient and practical tool for a wide range of graph transformation tasks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Evgeny Skvortsov and Yilin Xia and Bertram Ludäscher and Shawn Bowers 2026 Is Part Of TGDK, Volume 4, Issue 2 (2024): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2 Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/TGDK.4.2.7 urn:nbn:de:0030-drops-275889 https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.7 eng https://creativecommons.org/licenses/by/4.0/legalcode