Sciweavers

120 search results - page 1 / 24
» Managing Merged Data by Vague Functional Dependencies
Sort
View
78
Voted
ER
2004
Springer
75views Database» more  ER 2004»
15 years 6 months ago
Managing Merged Data by Vague Functional Dependencies
An Lu, Wilfred Ng
127
Voted
ICDE
2009
IEEE
125views Database» more  ICDE 2009»
14 years 11 months ago
Metric Functional Dependencies
When merging data from various sources, it is often the case that small variations in data format and interpretation cause traditional functional dependencies (FDs) to be violated,...
Nick Koudas, Avishek Saha, Divesh Srivastava, Sure...
177
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 1 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
127
Voted
ER
2006
Springer
137views Database» more  ER 2006»
15 years 4 months ago
Preference Functional Dependencies for Managing Choices
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
Wilfred Ng
143
Voted
CIKM
2010
Springer
14 years 11 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...