PartSS : An efficient partition-based filtering for edit distance constraints


Autoria(s): Li, Zhixu; Sitbon, Laurianne; Zhou, Xiaofang
Contribuinte(s)

Shen, Heng Tao

Zhang, Yanchun

Data(s)

01/01/2011

Resumo

This paper introduces PartSS, a new partition-based fil- tering for tasks performing string comparisons under edit distance constraints. PartSS offers improvements over the state-of-the-art method NGPP with the implementation of a new partitioning scheme and also improves filtering abil- ities by exploiting theoretical results on shifting and scaling ranges, thus accelerating the rate of calculating edit distance between strings. PartSS filtering has been implemented within two major tasks of data integration: similarity join and approximate membership extraction under edit distance constraints. The evaluation on an extensive range of real-world datasets demonstrates major gain in efficiency over NGPP and QGrams approaches.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/56386/

Publicador

ACS

Relação

http://eprints.qut.edu.au/56386/1/PartSS-ADC-final.pdf

http://crpit.com/confpapers/CRPITV115Li.pdf

Li, Zhixu, Sitbon, Laurianne, & Zhou, Xiaofang (2011) PartSS : An efficient partition-based filtering for edit distance constraints. In Shen, Heng Tao & Zhang, Yanchun (Eds.) Australasian Database Conference (ADC 2011), ACS, Perth, Australia , 103-112 .

Direitos

Copyright 2011 Australian Computer Society, Inc.

Copyright 2011, Australian Computer Society, Inc. This paper appeared at the 22nd Australasian Database Conference (ADC 2011), Perth, Australia, January 2011. Conferences in Research and Practice in Information Technology (CRPIT), Vol. 115, Heng Tao Shen and Yanchun Zhang, Ed. Reproduction for academic, not-for-profit purposes permitted provided this text is included.

Fonte

School of Electrical Engineering & Computer Science; Science & Engineering Faculty

Palavras-Chave #080107 Natural Language Processing #080201 Analysis of Algorithms and Complexity #edit distance #partition-based #similarity join #approximate membership extraction
Tipo

Conference Paper