Semantic integration of tree-structured data using dimension graphs

被引:0
|
作者
Dalamagas, T [1 ]
Theodoratos, D
Koufopoulos, A
Liu, IT
机构
[1] Natl Tech Univ Athens, Sch Elect & Comp Engn, GR-15773 Zografos, Greece
[2] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
来源
JOURNAL ON DATA SEMANTICS IV | 2005年 / 3730卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Nowadays, huge volumes of Web data are organized or exported in tree-structured form. Popular examples of such structures are product catalogs of e-market stores, taxonomies of thematic categories, XML data encodings, etc. Even for a single knowledge domain, name mismatches, structural differences and structural inconsistencies raise difficulties when many data sources need to be integrated and queried in a uniform way. In this paper, we present a method for semantically integrating tree-structured data. We introduce dimensions which are sets of semantically related nodes in tree structures. Based on dimensions, we suggest dimension graphs. Dimension graphs can be automatically extracted from trees and abstract their structural information. They are semantically rich constructs that provide query guidance to pose queries, assist query evaluation and support integration of tree-structured data. We design a query language to query tree-structured data. The language allows full, partial or no specification of the structure of the underlying tree-structured data used to issue queries. Thus, queries in our language are not restricted by the structure of the trees. We provide necessary and sufficient conditions for checking query satisfiability and we present a technique for evaluating satisfiable queries. Finally, we conducted several experiments to compare our method for integrating tree-structured data with one that does not exploit dimension graphs. Our results demonstrate the superiority of our approach.
引用
收藏
页码:250 / 279
页数:30
相关论文
共 50 条
  • [21] Tree Colors: Color Schemes for Tree-Structured Data
    Tennekes, Martijn
    de Jonge, Edwin
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2014, 20 (12) : 2072 - 2081
  • [22] Mining Tree-Structured Data on Multicore Systems
    Tatikonda, Shirish
    Parthasarathy, Srinivasan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2009, 2 (01):
  • [23] Monadic queries over tree-structured data
    Gottlob, G
    Koch, C
    17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2002, : 189 - 202
  • [24] Efficient change detection in tree-structured data
    Kim, DA
    Lee, SK
    WEB AND COMMUNICATION TECHNOLOGIES AND INTERNET-RELATED SOCIAL ISSUES - HSI 2003, 2003, 2713 : 675 - 681
  • [25] On subtyping of tree-structured data: A polynomial approach
    Bry, F
    Drabent, W
    Maluszynski, J
    PRINCIPLES AND PRACTICE OF SEMANTIC WEB REASONING, PROCEEDINGS, 2004, 3208 : 1 - 18
  • [27] Learning Tree-Structured Data in the Model Space
    Dong, Ya-dong
    Lv, Sheng-fei
    2016 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEM AND ARTIFICIAL INTELLIGENCE (ISAI 2016), 2016, : 258 - 266
  • [28] Hashing Tree-Structured Data: Methods and Applications
    Tatikonda, Shirish
    Parthasarathy, Srinivasan
    26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010, 2010, : 429 - 440
  • [29] Statistical Tests for Large Tree-Structured Data
    Bharath, Karthik
    Kambadur, Prabhanjan
    Dey, Dipak K.
    Rao, Arvind
    Baladandayuthapani, Veerabhadran
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2017, 112 (520) : 1733 - 1743
  • [30] Efficient similarity search for tree-structured data
    Li, Guoliang
    Liu, Xuhui
    Feng, Jianhua
    Zhou, Lizhu
    SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2008, 5069 : 131 - 149