Efficient indexing techniques for record matching and deduplication Online publication date: Sat, 21-Jun-2014
by Anjali Goel; Rajesh Prasad
International Journal of Computational Vision and Robotics (IJCVR), Vol. 4, No. 1/2, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook