From ternary relationship to relational tables: a case against common beliefs

dc.contributor.author	Camps Pare, Rafael
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-12-01T12:17:03Z
dc.date.available	2016-12-01T12:17:03Z
dc.date.issued	2002-01
dc.identifier.citation	Camps, R. "From ternary relationship to relational tables: a case against common beliefs". 2002.
dc.identifier.uri	http://hdl.handle.net/2117/97609
dc.description.abstract	The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, without adding other restrictions than candidate keys and inclusion dependencies.
dc.format.extent	8 p.
dc.language.iso	eng
dc.relation.ispartofseries	LSI-02-2-R
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject.other	N-ary relationships
dc.subject.other	ER-to-RM
dc.subject.other	3NF
dc.title	From ternary relationship to relational tables: a case against common beliefs
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	1880164
dc.description.version	Postprint (published version)
local.citation.author	Camps, R.

UPCommons. Portal del coneixement obert de la UPC