Role of determinism in query languages for data bases

DOI10.1007/BF00970872MaRDI QIDQ1112628zbMATH OpenFDO

Authors S. S. Magazov

Publication date 1987

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00970872

zbMATH Keywords

deterministic regular logicdynamic logicsclass of finite structurespredicate logic as query language for data basesregular logics

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Other nonclassical logic (03B60) Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Recommendations

• Comparison of expressive power of some query languages for databases
• Datalog extensions for database queries and updates
• scientific article; zbMATH DE number 176244
• Expressiveness of efficient semi-deterministic choice constructs
• Deterministic dynamic logic is strictly weaker than dynamic logic

Cites work

• scientific article; zbMATH DE number 3778723 (Why is no real title available?)
• Expressing program looping in regular dynamic logic
• Structure and complexity of relational queries
• The comparison of the expressive power of first-order dynamic logics

Cited in

(2)

• About finite predicate logic
• The expressiveness of a family of finite set languages

This page was built for publication: Role of determinism in query languages for data bases

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