<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>16</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2009</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A New Category of Relations: Combinationally Constrained Relations</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">3225</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>S. M. T.</FirstName>
					<LastName>Rohani Rankoohi</LastName>
<Affiliation>Department of Electrical &amp; Computer Engineering,Sharif University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>S. H.</FirstName>
					<LastName>Mirian Hosseinabadi</LastName>
<Affiliation>Department of Electrical &amp; Computer Engineering,Sharif University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2009</Year>
					<Month>09</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>Abstract. The normalization theory in relational database design is a classical subject investigated
in dierent papers. The results of these research works are the stronger normal forms such as 5NF,
DKNF and 6NF. In these normal forms, there are less anomalies and redundancies, but it does not mean
that these stronger normal forms are free of anomalies and redundancies. Each normal form discussion
is based on a particular constraint. In this paper, we introduce relations which contain a new kind of
constraint called combinational constraint&quot;. We distinguish two important kinds of this constraints,
namely Strong and Weak. Also we classify the Combinationally Constrained Relations as Single and
Multiple. We introduce all kinds of such relations and specify them using their quantitative properties,
formally. It can be shown that these relations are in 5NF or 6NF and still they contain redundancies and
have some anomalies.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Relation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Constrained attribute</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Free attribute</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Combinational constraint</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Combinationally constrained relation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Weak combinational constraint</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Strong combinational constraint</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_3225_6dfe08eda761bd321f8a9b239f6f4ec3.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
