Efficient Evaluation of Arbitrary Relational Calculus Queries

DOI10.46298/lmcs-19(4:38)2023arXiv2210.09964MaRDI QIDQ6137874

Martin Raszyk, Dmitriy Traytel, David A. Basin, Srđan Krstić

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.09964

zbMATH Keywords

relational calculusquery translationrelative safetysafe range

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Safety, domain independence and translation of complex value database queries
• The decision problem for database dependencies
• Domain independence and the relational calculus
• Finite presentations of infinite structures: Automata and interpretations
• Monitoring Metric First-Order Temporal Properties
• Relational queries over interpreted structures
• The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
• Introduction to constraint databases

This page was built for publication: Efficient Evaluation of Arbitrary Relational Calculus Queries