Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

SIGMOD
2006
ACM

favoriteEmaildiscussreport

105views Database» more SIGMOD 2006»

Why is schema matching tough and what can we do about it?

14 years 5 months ago

Why is schema matching tough and what can we do about it?

Download www.dit.unitn.it

In this paper we analyze the problem of schema matching, explain why it is such a "tough" problem and suggest directions for handling it effectively. In particular, we present the monotonicity principle and see how it leads to the use of top-K mappings rather than a single mapping.

Avigdor Gal

Real-time Traffic

Database | Monotonicity Principle | SIGMOD 2006 |

claim paper

Related Content

» Computational Linguistics What About the Linguistics

» Agent interaction in distributed POMDPs and its implications on complexity

» WebTables exploring the power of tables on the web

» Archiving scientific data

» Matrices as Arrows

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2006
Where	SIGMOD
Authors	Avigdor Gal

Comments (0)