Comparison of expressive power of some query languages for databases

DOI10.1134/S0081543811060174MaRDI QIDQ2510772zbMATH OpenOpenAlexFDO

Authors Michael A. Taitslin

Publication date 4 August 2014

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543811060174

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Expressive power of SQL.
• scientific article; zbMATH DE number 2080461
• Comparison of functional and predicative query paradigms
• scientific article; zbMATH DE number 176244
• The comparative analysis of the expressive possibilities of the SQL-92 standard and the classical SQL(SEQUEL)

Cites work

• A relational model of data for large shared data banks
• Collapse results for query languages in database theory
• Datalog vs first-order logic
• Elementary induction on abstract structures
• Elements of finite model theory.
• Fixpoint logics, relational machines, and computational complexity
• scientific article; zbMATH DE number 4180775 (Why is no real title available?)
• scientific article; zbMATH DE number 4055578 (Why is no real title available?)
• scientific article; zbMATH DE number 1302667 (Why is no real title available?)
• scientific article; zbMATH DE number 2021555 (Why is no real title available?)
• scientific article; zbMATH DE number 1479611 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Languages that Capture Complexity Classes
• Relational queries computable in polynomial time
• Structure and complexity of relational queries

Cited in

(21)

• Polynomial queries to relational data bases
• Role of determinism in query languages for data bases
• The Kolmogorov expressive power of Boolean query languages
• Expressive power of SQL.
• How expressive is stratified aggregation?
• LIKE patterns and complexity
• The comparative analysis of the expressive possibilities of the SQL-92 standard and the classical SQL(SEQUEL)
• scientific article; zbMATH DE number 2088793 (Why is no real title available?)
• scientific article; zbMATH DE number 3854473 (Why is no real title available?)
• scientific article; zbMATH DE number 8794 (Why is no real title available?)
• Many-Sorted First-Order Logic Database Language
• scientific article; zbMATH DE number 176241 (Why is no real title available?)
• scientific article; zbMATH DE number 176244 (Why is no real title available?)
• scientific article; zbMATH DE number 2080398 (Why is no real title available?)
• scientific article; zbMATH DE number 2080461 (Why is no real title available?)
• scientific article; zbMATH DE number 871233 (Why is no real title available?)
• Relational completeness of query languages for annotated databases
• A framework for comparing query languages in their ability to express Boolean queries
• The expressiveness of a family of finite set languages
• Comparison of functional and predicative query paradigms
• Languages PQL and FO+LFP remain equivalent even in the absence of order

This page was built for publication: Comparison of expressive power of some query languages for databases

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