Sciweavers

4 search results - page 1 / 1
» VGRAM: Improving Performance of Approximate Queries on Strin...
Sort
View
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 5 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 4 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 6 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu