2002Unpublished venueRequires access

Data dependencies over rough relational expressions

Maho Nakata, T. Murai

Open publisher page 2 citations

Abstract

Functional dependencies, including weighted ones, are formulated in the same manner as other constraints in a relational database based on rough sets. A tuple that belongs to a relation is accompanied by a supplementary attribute value. When a functional dependency is imposed on a relation, a compatibility degree with the functional dependency is calculated for every tuple. Whether the tuple satisfies the functional dependency is determined by comparing the compatibility degree with a supplementary attribute value. Different inference rules from the conventional ones are obtained in augmentation for functional dependencies.

About this research paper

What this paper is about

Functional dependencies, including weighted ones, are formulated in the same manner as other constraints in a relational database based on rough sets. A tuple that belongs to a relation is accompanied by a supplementary attribute value. When a functional dependency is imposed on a relation, a compatibility degree with the functional dependency is calculated for every tuple. Whether the tuple satisfies the functional dependency is determined by comparing the compatibility degree with a supplementary attribute value. Different inference rules from the conventional ones are obtained in augmentation for functional dependencies.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Functional dependencies, including weighted ones, are formulated in the same manner as other constraints in a relational database based on rough sets. A tuple that belongs to a relation is accompanied by a supplementary attribute value. When a functional dependency is imposed on a relation, a compatibility degree with the functional dependency is calculated for every tuple. Whether the tuple satisfies the functional dependency is determined by comparing the compatibility degree with a supplementary attribute value. Different inference rules from the conventional ones are obtained in augmentation for functional dependencies.

Key concepts: Functional dependency, Tuple, Compatibility (geochemistry), Dependency (UML), Dependency theory (database theory), Relational database, Computer science, Rough set

Related papers

Back to paper searchBrowse research topicsOriginal source
Data dependencies over rough relational expressions — Research Paper | ScholarLens