关于数据库清理的一种模糊匹配算法  

A Indistinct Marring Algorithm about Data Base Cleaning

作　　者：金延红[1] 张国煊[1] 

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310027

出　　处：《计算机与网络》2010年第14期68-72,共5页Computer & Network

摘　　要：由于数据来源复杂,日积月累,数据库中有很多重复数据。在"电话号码"和"手机号码"字段数据中,不单单只有号码,还有汉字等,有的记录甚至有二三个号码;本文根据以上实际情况,提出了一种查出"重复"数据的模糊匹配算法,算法的基本思路是:从记录中,单单取出数字号码,然后进行比对。在匹配算法设计中,考虑了影响程序运行的各种各样差错、数据"异构"的情况。Many datas in the data bank are rePeated because of different sources day and day.There may be not only numbers but also Chinese characters,and even two or three numbers in the call number field and the mobile number field.This paper puts forward a indistinct marring algorithm which finds out repeated datas according to the above actual case.The basic line of thought of the algorithm call numbers and mobile numbers are brought out from fields,after that these numbers are compared. Various mistakes which influences the program operation are considered in the marring algorithm, ＂Heterogeneous＂ Data is considered also.

关 键 词：数据库 记录 算法 类 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]