Bootstrapping Uncertainty in Schema Covering

  • Nguyen Thanh Toan
  • Phan Thanh Cong
  • Duong Chi Thang
  • Nguyen Quoc Viet HungEmail author
  • Bela Stantic
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10837)


Schema covering is the process of representing large and complex schemas by easily comprehensible common objects. This task is done by identifying a set of common concepts from a repository called concept repository and generating a cover to describe the schema by the concepts. Traditional schema covering approach has two shortcomings: it does not model the uncertainty in the covering process, and it requires user to state an ambiguity constraint which is hard to define. We remedy this problem by incorporating probabilistic model into schema covering to generate probabilistic schema cover. The integrated probabilities not only enhance the coverage of cover results but also eliminate the need of defining the ambiguity parameter. Experiments on real-datasets show the competitive performance of our approach.


Schema matching Schema covering Probabilistic models 


  1. 1.
    Hung, N.Q.V., Luong, X.H., Miklós, Z., Quan, T.T., Aberer, K.: Collaborative schema matching reconciliation. In: CoopIS, pp. 222–240 (2013)Google Scholar
  2. 2.
    Hung, N.Q.V., Tam, N.T., Chau, V.T., Wijaya, T.K., Miklós, Z., Aberer, K., Gal, A., Weidlich, M.: SMART: a tool for analyzing and reconciling schema matching networks. In: ICDE, pp. 1488–1491 (2015)Google Scholar
  3. 3.
    Hung, N.Q.V., Tam, N.T., Miklós, Z., Aberer, K.: On leveraging crowdsourcing techniques for schema matching networks. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013. LNCS, vol. 7826, pp. 139–154. Springer, Heidelberg (2013). Scholar
  4. 4.
    Hung, N.Q.V., Luong, X.H., Miklós, Z., Quan, T.T., Aberer, K.: An MAS negotiation support tool for schema matching. In: AAMAS, pp. 1391–1392 (2013)Google Scholar
  5. 5.
    Hung, N.Q.V., Tam, N.T., Miklós, Z., Aberer, K.: Reconciling schema matching networks through crowdsourcing. EAI, e2 (2014)Google Scholar
  6. 6.
    Hung, N.Q.V.: Reconciling schema matching networks. Ph.D. thesis, Ecole Polytechnique Federale de Lausanne (2014)Google Scholar
  7. 7.
    Gal, A., Sagi, T., Weidlich, M., Levy, E., Shafran, V., Miklós, Z., Hung, N.Q.V.: Making sense of top-k matchings: a unified match graph for schema matching. In: IIWeb, p. 6 (2012)Google Scholar
  8. 8.
    Saha, B., Stanoi, I., Clarkson, K.L.: Schema covering: a step towards enabling reuse in information integration. In: ICDE, pp. 285–296 (2010)Google Scholar
  9. 9.
    Gal, A., Katz, M., Sagi, T., Weidlich, M., Aberer, K., Hung, N.Q.V., Miklós, Z., Levy, E., Shafran, V.: Completeness and ambiguity of schema cover. In: CoopIS, pp. 241–258 (2013)CrossRefGoogle Scholar
  10. 10.
    Hung, N.Q.V., Wijaya, T.K., Miklós, Z., Aberer, K., Levy, E., Shafran, V., Gal, A., Weidlich, M.: Minimizing human effort in reconciling match networks. In: Ng, W., Storey, V.C., Trujillo, J.C. (eds.) ER 2013. LNCS, vol. 8217, pp. 212–226. Springer, Heidelberg (2013). Scholar
  11. 11.
    Hung, N.Q.V., Tam, N.T., Miklós, Z., Aberer, K., Gal, A., Weidlich, M.: Pay-as-you-go reconciliation in schema matching networks. In: ICDE, pp. 220–231 (2014)Google Scholar
  12. 12.
    Arnold, P., Rahm, E.: Enriching ontology mappings with semantic relations. Data Knowl. Eng. 93, 1–18 (2014)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Nguyen Thanh Toan
    • 1
  • Phan Thanh Cong
    • 1
  • Duong Chi Thang
    • 2
  • Nguyen Quoc Viet Hung
    • 3
    Email author
  • Bela Stantic
    • 3
  1. 1.Bach Khoa UniversityHo Chi MinhVietnam
  2. 2.Ecole Polytechnique Federale de LausanneLausanneSwitzerland
  3. 3.Griffith UniversityGold CoastAustralia

Personalised recommendations