Effectiveness Bounds for Non-Exhaustive Schema Matching Systems

M. Smiljanic; Maurice van Keulen; Willem Jonker

doi:10.1109/ICDEW.2006.51

Effectiveness Bounds for Non-Exhaustive Schema Matching Systems

M. Smiljanic, Maurice van Keulen, Willem Jonker

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

182 Downloads (Pure)

Abstract

Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.

Original language	Undefined
Title of host publication	Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06)
Place of Publication	Los Alamitos, CA, USA
Publisher	IEEE
Pages	83
Number of pages	10
ISBN (Print)	0-7695-2571-7
DOIs	https://doi.org/10.1109/ICDEW.2006.51
Publication status	Published - 7 Apr 2006
Event	22nd International Conference on Data Engineering, ICDE 2006 - Atlanta, United States Duration: 3 Apr 2006 → 8 Apr 2006 Conference number: 22

Publication series

Name
Publisher	IEEE Computer Society Press
Number	2

Workshop

Workshop	22nd International Conference on Data Engineering, ICDE 2006
Abbreviated title	ICDE
Country/Territory	United States
City	Atlanta
Period	3/04/06 → 8/04/06

Keywords

IR-66511
METIS-238228
DB-IR: INFORMATION RETRIEVAL
DB-SDI: SCHEMA AND DATA INTEGRATION
DB-PRJBF: BELLFLOWER
EWI-7540

Access to Document

10.1109/ICDEW.2006.51

http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.51

Cite this

@inproceedings{8c594b601f8442f993433762b576170f,

title = "Effectiveness Bounds for Non-Exhaustive Schema Matching Systems",

abstract = "Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.",

keywords = "IR-66511, METIS-238228, DB-IR: INFORMATION RETRIEVAL, DB-SDI: SCHEMA AND DATA INTEGRATION, DB-PRJBF: BELLFLOWER, EWI-7540",

author = "M. Smiljanic and {van Keulen}, Maurice and Willem Jonker",

note = "Imported from EWI/DB PMS [db-utwente:inpr:0000003712], 3rd International Workshop on XML Schema and Data Management (XSDM'06); 22nd International Conference on Data Engineering, ICDE 2006 ; Conference date: 03-04-2006 Through 08-04-2006",

year = "2006",

month = apr,

day = "7",

doi = "10.1109/ICDEW.2006.51",

language = "Undefined",

isbn = "0-7695-2571-7",

publisher = "IEEE",

number = "2",

pages = "83",

booktitle = "Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06)",

address = "United States",

}

Smiljanic, M, van Keulen, M & Jonker, W 2006, Effectiveness Bounds for Non-Exhaustive Schema Matching Systems. in Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06)., 10.1109/ICDEW.2006.51, IEEE, Los Alamitos, CA, USA, pp. 83, 22nd International Conference on Data Engineering, ICDE 2006, Atlanta, Georgia, United States, 3/04/06. https://doi.org/10.1109/ICDEW.2006.51

Effectiveness Bounds for Non-Exhaustive Schema Matching Systems. / Smiljanic, M.; van Keulen, Maurice ; Jonker, Willem.
Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06). Los Alamitos, CA, USA: IEEE, 2006. p. 83 10.1109/ICDEW.2006.51.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Effectiveness Bounds for Non-Exhaustive Schema Matching Systems

AU - Smiljanic, M.

AU - van Keulen, Maurice

AU - Jonker, Willem

N1 - Conference code: 22

PY - 2006/4/7

Y1 - 2006/4/7

N2 - Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.

AB - Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.

KW - IR-66511

KW - METIS-238228

KW - DB-IR: INFORMATION RETRIEVAL

KW - DB-SDI: SCHEMA AND DATA INTEGRATION

KW - DB-PRJBF: BELLFLOWER

KW - EWI-7540

U2 - 10.1109/ICDEW.2006.51

DO - 10.1109/ICDEW.2006.51

M3 - Conference contribution

SN - 0-7695-2571-7

SP - 83

BT - Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW'06)

PB - IEEE

CY - Los Alamitos, CA, USA

T2 - 22nd International Conference on Data Engineering, ICDE 2006

Y2 - 3 April 2006 through 8 April 2006

ER -