Expressiveness of efficient semi-deterministic choice constructs

DOI10.1007/3-540-58201-0_61MaRDI QIDQ4632419zbMATH OpenOpenAlexFDO

Authors Jan Van den Bussche, Marc Gyssens, D. 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

binary relationdatabase schemeobject creationquery language

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A semideterministic approach to object creation and nondeterminism in database queries
• Semantics and expressive power of nondeterministic constructs in deductive databases
• Role of determinism in query languages for data bases
• scientific article; zbMATH DE number 176244
• scientific article; zbMATH DE number 3980541

Cites work

• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• scientific article; zbMATH DE number 1256674 (Why is no real title available?)
• scientific article; zbMATH DE number 515737 (Why is no real title available?)
• scientific article; zbMATH DE number 219233 (Why is no real title available?)
• Non-determinism in logic-based languages
• Object identity as a query language primitive
• On a hierarchy of classes for nested databases
• Relational queries computable in polynomial time

Cited in

(5)

• Role of determinism in query languages for data bases
• An extension of fixpoint logic with a symmetry-based choice construct
• Semantics and expressive power of nondeterministic constructs in deductive databases
• Choice inclusive general rough semantics
• A semideterministic approach to object creation and nondeterminism in database queries

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

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