A note on the translation of SQL to tuple calculus

Authors:
Martin Gogolla
Affiliations:
TU Braunschweig, Informatik, Abt. Datenbanken, Postfach 3329, D-3300 Braunschweig
Venue:
ACM SIGMOD Record
Year:
1990

Citing 4
Cited 3

Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries

IEEE Transactions on Software Engineering
A guide to the SQL standard

A guide to the SQL standard
The structure of the relational database model

The structure of the relational database model
Translating and Optimizing SQL Queries Having Aggregates

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases

Translating SQL for database reengineering

ACM SIGPLAN Notices
Applying constraint logic programming to SQL test case generation

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Observing SQL queries in their natural habitat

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note presents a translation of a subset of the relational query language SQL into the well known tuple calculus. Roughly speaking, tuple calculus corresponds to first order predicate calculus. The SQL subset is relationally complete and represents a “relational core” of the language. Nevertheless, our translation is simple and elegant. Therefore it is especially well suited as a beginners course into the principles of a formal definition of SQL.