A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Approximate string matching using compressed suffix arrays
Theoretical Computer Science
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
Fast exact string matching algorithms
Information Processing Letters
A Comparison of Personal Name Matching: Techniques and Practical Issues
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
A four-stage algorithm for updating a Burrows-Wheeler transform
Theoretical Computer Science
Robust record linkage blocking using suffix arrays
Proceedings of the 18th ACM conference on Information and knowledge management
Dynamic extended suffix arrays
Journal of Discrete Algorithms
Indexed multi-pattern matching
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Record matching works on large sets of data, which may be either from single database or several databases. As size of database increases very rapidly, demand of matching process becomes too high. So, there is demand to minimise the number of matching pair records, time and cost in comparing records using efficient matching techniques. Recent researches have been done on record matching by number of researchers using various indexing techniques but as such they are not effective. Suffix array SA and q-gram are used indexing technique, but they lack somewhere in computation. This paper proposes two new indexing techniques: inverse suffix array ISA and Burrows-Wheeler transformation BWT to improve the performance of record matching process. The approach ISA can handle the multiple keywords simultaneously. We compare the performance of the proposed techniques with existing suffix array and q-gram indexing techniques and found that the new techniques are better than the earlier techniques.