Abstract
Information granulation is a powerful tool for data analysis and processing. However, not much attention has been devoted to application of this tool to data stored in a relational structure. This paper extends the notion of information granules to a relational case. Two information systems intended to store relational data are proposed. This study also extends a granule description language to express information granules derived from relational data. The proposed approach enables to analyze a given problem at different levels of granularity of relational data. This can find application in searching for patterns in data mining.
