236 search results - page 24 / 48 » Usage-Based Schema Matching |
FASE
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Nested if-then-else statements is the most common programming schema in applications like data transformation or data analysis. In most cases, these can be replaced by hi...
DEBU
2000
13 years 8 months ago
2000
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
IADIS
2008
13 years 10 months ago
2008
Lots of work has already been published on developing applications for schema or ontology matching. Most of these approaches do not take the usability aspect into account. This pa...
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
The difficulty inherent in schema matching has led to the development of several generic match algorithms. This paper describes how we adapted general approaches to the specific t...
AICCSA
2007
IEEE
14 years 3 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...