A universal formalism to express decompositions, functional dependencies and other constraints in a relational database
type: Item
instance of: scholarly article
title: A universal formalism to express decompositions, functional dependencies and other constraints in a relational database
zbMATH Open document ID: 0503.68072
DOI: 10.1016/0304-3975(82)90057-3
author: S. Singh
published in: Theoretical Computer Science
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 3793448
zbMATH Keywords: general dependency
zbMATH Keywords: data dependency
zbMATH Keywords: decomposition of relations
zbMATH Keywords: decidability of implication problem
Wikidata QID: Q114683737
MaRDI profile type: Publication
full work available at URL: 0304-3975(82)90057-3
OpenAlex ID: W2032009002
cites work: Q4050122
cites work: A relational model of data for large shared data banks
cites work: Q3942429
cites work: The interaction of integrity constraints in an information system
cites work: Q3871960
cites work: Q4162638
cites work: A Complete Axiomatization of Full Join Dependencies
description: scientific article; zbMATH DE number 3793448