3 citations · 4 across the 6 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2021
Accurate and Efficient Suffix Tree Based Privacy-Preserving String Matching
Sirintra Vaiwsri, Thilina Ranbaduge, Peter Christen +1
The task of calculating similarities between strings held by different organizations without revealing these strings is an increasingly important problem in areas such as health in…
cs.DB2017
Exploiting Redundancy, Recurrence and Parallelism: How to Link Millions of Addresses with Ten Lines of Code in Ten Minutes
Yuhang Zhang, Tania Churchill, Kee Siong Ng
Accurate and efficient record linkage is an open challenge of particular relevance to Australian Government Agencies, who recognise that so-called wicked social problems are best t…