Automated mining of granular database scheme

We introduce an algorithm for automatic mining of data dependencies in a relation. The mined data dependencies can be used to construct a granular database scheme. Unlike the traditional approach, the granular database scheme has the following advantages: (1) it is able to present a coarse or refine...

Full description

Saved in:
Bibliographic Details
Main Authors: Wong, S.K.M., Wu, D.
Format: Conference Proceeding
Language:English
Subjects:
Bayesian methods
Computational Intelligence Society
Computer science
Data mining
Markov random fields
Relational databases
Tin
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce an algorithm for automatic mining of data dependencies in a relation. The mined data dependencies can be used to construct a granular database scheme. Unlike the traditional approach, the granular database scheme has the following advantages: (1) it is able to present a coarse or refined view of the relations in the database; (2) queries can be answered more efficiently using the granular database scheme than the flat database scheme.
DOI:10.1109/FUZZ.2002.1005076