Publication
Title
Searching for dependencies at multiple abstraction levels
Author
Abstract
The notion of roll- up dependency (RUD) extends functional dependencies with generalization hierarchies. RUDs can be applied in OLAP and database design. The problem of discovering RUDs in large databases is at the center of this paper. An algorithm is provided that relies on a number of theoretical results. The algorithm has been implemented; results on two real- life datasets are given. The extension of functional dependency (FD) with roll- ups turns out to capture meaningful rules that are outside the scope of classical FD mining. Performance figures show that RUDs can be discovered in linear time in the number of tuples of the input dataset.
Language
English
Source (journal)
ACM transactions on database systems. - New York, N.Y., 1976, currens
Publication
New York, N.Y. : 2002
ISSN
0362-5915
1557-4644 [online]
Volume/pages
27:3(2002), p. 229-260
ISI
000178833400001
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 08.10.2008
Last edited 05.09.2017
To cite this reference