Reducing uncertainty of schema matching via crowdsourcing
Authors:
Open Access
- 1 July 2013
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 6 (9) , 757-768
Abstract
Schema matching is a central challenge for data integration systems. Automated tools are often uncertain about schema matchings they suggest, and this uncertainty is inherent since it arises from the inability of the schema to fully capture the semantics of the represented data. Human common sense can often help. Inspired by the popularity and the success of easily accessible crowdsourcing platforms, we explore the use of crowdsourcing to reduce the uncertainty of schema matching. Since it is typical to ask simple questions on crowdsourcing platforms, we assume that each question, namely Correspondence Correctness Question (CCQ), is to ask the crowd to decide whether a given correspondence should exist in the correct matching. We propose frameworks and efficient algorithms to dynamically manage the CCQs, in order to maximize the uncertainty reduction within a limited budget of questions. We develop two novel approaches, namely "Single CCQ" and "Multiple CCQ", which adaptively select, publish and manage the questions. We verified the value of our solutions with simulation and real implementation.Keywords
This publication has 9 references indexed in Scilit:
- Crowdsourcing systems on the World-Wide WebCommunications of the ACM, 2011
- Uncertain Schema Matching2011
- Integrating and Ranking Uncertain Scientific DataInternational Conference on Data Engineering, 2009
- Data integration with uncertaintyThe VLDB Journal, 2008
- Managing Uncertainty in Schema Matching with Top-K Schema Mappings2006
- A framework for modeling and evaluating automatic semantic reconciliationThe VLDB Journal, 2005
- Translating Web Data2002
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001
- The budgeted maximum coverage problemInformation Processing Letters, 1999