文档介绍：2 2 2
Fang Jiao1) ,2) M EN G Xiao Feng1) J IA Lin Lin1)
1) ( School of Inf ormation , Renmin Universit y of China , Bei j ing 100872)
2) ( X uz hou N ormal Universit y , X uz hou , J iangshu 221116)
Abstract Wit h increasing of Deep Web , providing high quality data from autonomous , hetero
geneous and dynamic Web databases to users is becoming a hot topic in recent research of Deep
Web integration service. How to generate t he reasonable schema matching between t he keywords
of the user request and schema of integrated interface as well as between t he schema of integrated
interface and that of Web database interface is essential. The related works about schema matc
hing are generating t he best schema matching which slide over it s uncertainty. This paper analy
zes t he uncertainty of schema matching , and t hen p roposes a series of similarity measures. To re
duce t he cost of execution , it proposes t he type based optimization method and schema matching
pruning met hod of numeric data. Based on above analysis , t his paper proposes t he uncertain sche
ma matching met hod. The experiment s prove t he effectiveness and efficiency of the new method.