Authors: Anjali Goel; Rajesh Prasad
Addresses: Department of Computer Science, Ajay Kumar Garg Engineering College, Ghaziabad, Uttar Pradesh, 201009, India ' Department of Computer Science, Ajay Kumar Garg Engineering College, Ghaziabad, Uttar Pradesh, 201009, India
Abstract: 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.
Keywords: Burrows-Wheeler transformation; BWT; inverse suffix array; ISA; record matching; efficient indexing; deduplication; multiple keywords.
International Journal of Computational Vision and Robotics, 2014 Vol.4 No.1/2, pp.75 - 85
Received: 01 Apr 2013
Accepted: 28 Jul 2013
Published online: 18 Feb 2014 *