Efficient iterative programs with distributed data collections

DOI10.1016/J.JLAMP.2025.101047MaRDI QIDQ7009388zbMATH OpenFDO

Authors Sarah Chlyah, Nils Gesbert, Pierre Genevès, Nabil Layaïda

Publication date 20 March 2025

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JLAMP.2025.101047

zbMATH Keywords

distributed datafixpoint operatoroptimizationrewrite rules

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Database theory (68P15) Grammars and rewriting systems (68Q42)

Cites work

• A relational model of data for large shared data banks
• An algebra for distributed Big Data analytics
• Comprehending monads
• Comprehending Ringads
• Efficiently deciding -calculus with converse over finite trees
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Graph Logics with Rational Relations and the Generalized Intersection Problem
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 756050 (Why is no real title available?)
• scientific article; zbMATH DE number 1903365 (Why is no real title available?)
• Modal logics and mu-calculi: An introduction
• Optimizing object queries using an effective calculus
• Principles of programming with complex objects and collection types
• Querying Graphs with Data
• Recursion equations as a programming language
• Regular queries on graph databases
• Results on the propositional \(\mu\)-calculus
• The mu-calculus and Model Checking

This page was built for publication: Efficient iterative programs with distributed data collections

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