A Coq Formalization of the Relational Data Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A Coq Formalization of the Relational Data Model

Abstract

In this article, we propose a coq formalization of the relational data model which underlies relational database systems. More precisely, we present and formalize the data definition part of the model including integrity constraints. We model two different query language formalisms: relational algebra and conjunctive queries. The former is the basis of We also present logical query optimization and prove the main ''database theorems'': algebraic equivalences, the homomorphism theorem and conjunctive query minimization.
No file

Dates and versions

hal-00924156 , version 1 (06-01-2014)

Identifiers

  • HAL Id : hal-00924156 , version 1

Cite

Véronique Benzaken, Évelyne Contejean, Stefania Dumbrava. A Coq Formalization of the Relational Data Model. ESOP - 23rd European Symposium on Programming, Apr 2014, Grenoble, France. ⟨hal-00924156⟩
244 View
0 Download

Share

Gmail Facebook X LinkedIn More