Identifying Symmetric and Transitive Binary Relations
Khalid Al-Barrak1, Mohammed Alawairdhi2, Kailash Kumar3
1Dr. Khalid Al-Barrak, George Mason University, Virginia.
2Dr. Mohammed Alawairdhi, Saudi Electronic University, Saudi Arabia.
3Dr. Kailash Kumar, Saudi Electronic University, Saudi Arabia.
Manuscript received on 05 March 2019 | Revised Manuscript received on 12 March 2019 | Manuscript Published on 20 March 2019 | PP: 135-140 | Volume-8 Issue- 4S2 March 2019 | Retrieval Number: D1S0028028419/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In real world, the binary relations play a vital role in capturing relation between pair of objects. This paper primarily focuses on identifying the candidate symmetric and candidate transitive binary relations in the relational database. In this paper, an algorithm is devised to identify symmetric and transitive binary relations for a specific pattern.
Keywords: Binary Relations, Symmetric Relations, Transitive Relations, Heuristic Data Modeling, Data Analysis.
Scope of the Article: Measurement & Performance Analysis