Expressiveness of efficient semi-deterministic choice constructs

DOI10.1007/3-540-58201-0_61zbMath1418.68074OpenAlexW1962446071MaRDI QIDQ4632419

Jan Van den Bussche, Marc Gyssens, Dirk Van Gucht

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_61

zbMATH Keywords

query languagebinary relationdatabase schemeobject creation

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

A semideterministic approach to object creation and nondeterminism in database queries ⋮ An extension of fixpoint logic with a symmetry-based choice construct

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a hierarchy of classes for nested databases
• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• Non-determinism in logic-based languages
• Object identity as a query language primitive
• Relational queries computable in polynomial time

This page was built for publication: Expressiveness of efficient semi-deterministic choice constructs