Comparison of expressive power of some query languages for databases

DOI10.1134/S0081543811060174zbMath1358.68089OpenAlexW2021805180MaRDI QIDQ2510772

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Elementary induction on abstract structures
• Datalog vs first-order logic
• Structure and complexity of relational queries
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• Fixpoint logics, relational machines, and computational complexity
• Collapse results for query languages in database theory
• A relational model of data for large shared data banks