Characterizing Schema Mappings via Data Examples

被引:8
|
作者
Alexe, Bogdan [1 ]
Kolaitis, Phokion G. [1 ]
Tan, Wang-Chiew [1 ]
机构
[1] Univ Calif Santa Cruz, Santa Cruz, CA 95064 USA
关键词
Schema mappings; data examples; data exchange; data integration;
D O I
10.1145/1807085.1807120
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange and data integration, and have been the object of extensive research investigations. Since in real-life applications schema mappings can be quite complex, it is important to develop methods and tools for understanding, explaining, and refining schema mappings. A promising approach to this effect is to use "good" data examples that illustrate the schema mapping at hand. We develop a foundation for the systematic investigation of data examples and obtain a number of results on both the capabilities and the limitations of data examples in explaining and understanding schema mappings. We focus on schema mappings specified by source-to-target tuple generating dependencies (s-t tgds) and investigate the following problem: which classes of s-t tgds can be "uniquely characterized" by a finite set of data examples? Our investigation begins by considering finite sets of positive and negative examples, which are arguably the most natural choice of data examples. However, we show that they are not powerful enough to yield interesting unique characterizations. We then consider finite sets of universal examples, where a universal example is a pair consisting of a source instance and a universal solution for that source instance. We unveil a tight connection between unique characterizations via universal examples and the existence of Armstrong bases (a relaxation of the classical notion of Armstrong databases). On the positive side, we show that every schema mapping specified by LAV s-t tgds is uniquely characterized by a finite set of universal examples with respect to the class of LAV s-t tgds. Moreover, this positive result extends. to the much broader classes of n-modular schema mappings, n a positive-integer. Finally, we show that, on the negative side, then; are schema mappings specified by GAV s-t tgds that are not uniquely characterized by any finite set of universal examples and negative examples with respect to the class of GAV s-t tgds (hence a:so with respect to the class of all s-t tgds).
引用
收藏
页码:261 / 271
页数:11
相关论文
共 50 条
  • [31] Data Vault Mappings to Dimensional Model Using Schema Matching
    Puonti, Mikko
    Raitalaakso, Timo
    [J]. RESEARCH AND PRACTICAL ISSUES OF ENTERPRISE INFORMATION SYSTEMS, CONFENIS 2019, 2019, 375 : 55 - 64
  • [32] Answering queries on schema mappings
    Li, Y
    Liu, D
    Zhang, WM
    [J]. PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 2113 - 2117
  • [33] Normalization and Optimization of Schema Mappings
    Gottlob, Georg
    Pichler, Reinhard
    Savenkov, Vadim
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2009, 2 (01):
  • [34] Normalization and optimization of schema mappings
    Georg Gottlob
    Reinhard Pichler
    Vadim Savenkov
    [J]. The VLDB Journal, 2011, 20 : 277 - 302
  • [35] The Structure of Inverses in Schema Mappings
    Fagin, Ronald
    Nash, Alan
    [J]. JOURNAL OF THE ACM, 2010, 57 (06)
  • [36] Normalization and optimization of schema mappings
    Gottlob, Georg
    Pichler, Reinhard
    Savenkov, Vadim
    [J]. VLDB JOURNAL, 2011, 20 (02): : 277 - 302
  • [37] Composition and Inversion of Schema Mappings
    Arenas, Marcelo
    Perez, Jorge
    Reutter, Juan
    Riveros, Cristian
    [J]. SIGMOD RECORD, 2009, 38 (03) : 17 - 28
  • [38] Approximation Algorithms for Schema-Mapping Discovery from Data Examples
    Ten Cate, Balder
    Kolaitis, Phokion G.
    Qian, Kun
    Tan, Wang-Chiew
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2017, 42 (02):
  • [39] AdvCheck: Characterizing adversarial examples via local gradient checking
    Chen, Ruoxi
    Jin, Haibo
    Chen, Jinyin
    Zheng, Haibin
    Zheng, Shilian
    Yang, Xiaoniu
    Yang, Xing
    [J]. COMPUTERS & SECURITY, 2024, 136
  • [40] Using OWL ontology for reasoning about schema mappings in data exchange systems
    Pankowski, Tadeusz
    [J]. ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, 2012, 243 : 430 - 439