ANALYSIS OF CYCLICALLY CONSTRAINED RELATION AND ITS FLEXIBLE DECOMPOSITION ALGORITHMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ROUHANI RANKOUHI S.M.T.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Year:2006 | Volume:40 | Issue:3 (97) Page(s): 361-372

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

679

Download:

Cites:

Information Journal Paper

Title

ANALYSIS OF CYCLICALLY CONSTRAINED RELATION AND ITS FLEXIBLE DECOMPOSITION ALGORITHMS

Author(s)

ROUHANI RANKOUHI S.M.T. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

The subject of 4NF, but not 5NF, relation is introduced in the textbooks, but no theoretical study is achieved on their decomposition algorithm. In this kind of normal relation, there exists a special semantic constraint so called "cyclic nature constraint" which needs yet a theoretical analysis. On the other hand, in the practice of database design it is sometimes necessary to decompose a relation into two or more relations. In this paper, we f11st mention the reason for decomposing a relation, and then give a rigorous defmition of cyclically constraint relation. Then by providing five Lemmas and their proofs, we describe in detail the characteristics of this kind of relation. We also introduce tow theorems and their proofs and provide the algorithms, based on these theorems to decompose the cyclically constrained relation, with a very high degree of flexibility. Finally, we discuss the results of this research.

Cites

No record.

References

No record.

Cite

APA: Copy

ROUHANI RANKOUHI, S.M.T.. (2006). ANALYSIS OF CYCLICALLY CONSTRAINED RELATION AND ITS FLEXIBLE DECOMPOSITION ALGORITHMS . JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 40(3 (97)), 361-372. SID. https://sid.ir/paper/14465/en

Vancouver: Copy

ROUHANI RANKOUHI S.M.T.. ANALYSIS OF CYCLICALLY CONSTRAINED RELATION AND ITS FLEXIBLE DECOMPOSITION ALGORITHMS . JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2006;40(3 (97)):361-372. Available from: https://sid.ir/paper/14465/en

IEEE: Copy

S.M.T. ROUHANI RANKOUHI, “ANALYSIS OF CYCLICALLY CONSTRAINED RELATION AND ITS FLEXIBLE DECOMPOSITION ALGORITHMS ,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 40, no. 3 (97), pp. 361–372, 2006, [Online]. Available: https://sid.ir/paper/14465/en

Related Journal Papers