Discovering Matching Dependencies - Computer Science > DatabasesReportar como inadecuado

Discovering Matching Dependencies - Computer Science > Databases - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The concept of matching dependencies mds is recently pro- posed forspecifying matching rules for object identification. Similar to the functionaldependencies with conditions, mds can also be applied to various data qualityapplications such as violation detection. In this paper, we study the problemof discovering matching dependencies from a given database instance. First, weformally define the measures, support and confidence, for evaluating utility ofmds in the given database instance. Then, we study the discovery of mds withcertain utility requirements of support and confidence. Exact algorithms aredeveloped, together with pruning strategies to improve the time performance.Since the exact algorithm has to traverse all the data during the computation,we propose an approximate solution which only use some of the data. A bound ofrelative errors introduced by the approximation is also developed. Finally, ourexperimental evaluation demonstrates the efficiency of the proposed methods.

Autor: Shaoxu Song, Lei Chen


Documentos relacionados