Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/42007
Title: String recedence count matrix
Authors: Cao, X.
Tung, A.K.H. 
Ooi, B.C. 
Tan, K.-L. 
Li, S.C.
Issue Date: 2004
Source: Cao, X.,Tung, A.K.H.,Ooi, B.C.,Tan, K.-L.,Li, S.C. (2004). String recedence count matrix. Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM 16 : 345-348. ScholarBank@NUS Repository.
Abstract: In this paper, we propose a filter-and-refine string join algorithm. While the filtering phase can rapidly prune away strings that are not joinable, the refinement phase employs a comprehensive algorithm to remove the remaining false alarms. The efficiency of the proposed scheme lies in the use of the precedence count matrix (PCM) for computing the edit distance between two sequences. With PCM, the complexity of sequence comparison is a constant time. We also evaluated the proposed sequence join algorithm, and our study shows that it outperforms the known techniques.
Source Title: Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM
URI: http://scholarbank.nus.edu.sg/handle/10635/42007
ISSN: 10993371
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

45
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.