Abstract
In the present paper we give a new definition of vague multivalued dependencies in database relations. The definition is based on application of arbitrary similarity measure on vague values, which is known to be reflexive, symmetric, and max-min transitive. The definition is adapted in order to include the imprecise and precise vague multivalued dependencies. The inference rules for new vague multivalued dependencies are listed, and are shown to be sound.
Highlights
In the present paper we give a new definition of vague multivalued dependencies in database relations
The definition is based on application of arbitrary similarity measure on vague values, which is known to be reflexive, symmetric, and max-min transitive
The inference rules for new vague multivalued dependencies are listed, and are shown to be sound
Summary
If R (A1, A2, ..., An) is a relation scheme on domains U1, U2,..., Un, where Ai is an attribute on the universe of discourse Ui, i ∈ I, r is a vague relation instance on R (A1, A2, ..., An), t1 and t2 are any two tuples in r, and X ⊆ {A1, A2, ..., An} is a set of attributes, the similarity measure S EX (t1, t2) between the tuples t1 and t2 on the attribute set X is given by. It is enough to prove that there exists u ∈ {1, 2, ..., N} such that S EU ait, aku ≥ θ, and v ∈ {1, 2, ..., N} such that S EU akw, aiv ≥ θ.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
