Chasing parallelism in aggregating graph queries

DOI10.4230/OASICS.TANNEN.5MaRDI QIDQ7241247zbMATH OpenFDO

Authors Alin Deutsch

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/OASICS.TANNEN.5

zbMATH Keywords

constraint-based minimizationgraph databasesgrouping and aggregationparallel graph computation modelsrewriting

Mathematics Subject Classification ID

Semirings (16Y60) Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Cites work

• scientific article; zbMATH DE number 1086723 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Provenance-directed Chase\&Backchase

This page was built for publication: Chasing parallelism in aggregating graph queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241247)