首页 | 本学科首页   官方微博 | 高级检索  
     

一种有效的XML数据清洗方法
引用本文:韩京宇,成瑜,董逸生.一种有效的XML数据清洗方法[J].计算机工程,2008,34(15):47-50.
作者姓名:韩京宇  成瑜  董逸生
作者单位:1. 南京邮电大学计算机学院,南京,210003;东南大学计算机科学与工程系,南京,210096
2. 东南大学计算机科学与工程系,南京,210096
基金项目:江苏省"十五"高科技计划基金资助项目
摘    要:研究XML格式的重复数据元素的特点,提出对于特定应用领域,在具体的上下文环境中主动学习XML重复元素的识别规则。通过结构转换,将结构不尽相同的XML数据映射成结构一致的数据,并通过学习不同层次数据元素间的依赖关系权重来获得匹配规则。根据学习得到的转换和匹配规则,采用哈希过滤的方法来提高检测重复XML元素的效率。该方法能够有效地解决XML重复检测面临的结构多样性的问题,理论分析和实验表明,该方法有较高的精度和效率。

关 键 词:主动学习  匹配规则  哈希

Efficient Cleaning Approach for XML Data
HAN Jing-yu,CHENG Yu,DONG Yi-sheng.Efficient Cleaning Approach for XML Data[J].Computer Engineering,2008,34(15):47-50.
Authors:HAN Jing-yu  CHENG Yu  DONG Yi-sheng
Affiliation:??1. School of Computer, Nanjing University of Posts & Telecomunications, Nanjing 210003; 2. Department of Computer Science and Engineering, Southeast University, Nanjing 210096??
Abstract:By studying characteristics of duplicate XML data, this paper proposes an active machine learning method for a specific application, which is applied to glean transformation rules and matching rules, and accurately identify duplicate XML elements. Transfomation rules are used to eliminate the structural diversities among elements and matching rules are used to identify the relationships between parent and child nodes. In turn, during the detection phase an efficient hash filter algorithm is proposed to reduce computational complexity. Theory and experiment shows that the method can solve this problem efficiently and effectively.
Keywords:active learning  matching rules  hash
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号