Skip to main content
Conference ProceedingsOPEN ACCESS

A Coq formalization of the relational data model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8410 LNCS 189-208
DOI: 10.1007/978-3-642-54833-8_11
14Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

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. We also present logical query optimization and prove the main "database theorems": algebraic equivalences, the homomorphism theorem and conjunctive query minimization. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Benzaken, V., Contejean, É., & Dumbrava, S. (2014). A Coq formalization of the relational data model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8410 LNCS, pp. 189–208). Springer Verlag. https://doi.org/10.1007/978-3-642-54833-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free