2012 IEEE 28th International Conference on Data Engineering 2012
DOI: 10.1109/icde.2012.68
|View full text |Cite
|
Sign up to set email alerts
|

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach

Abstract: Abstract-We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given dictionary. To solve this problem, the current state-ofart approach involves first applying an approximate, fast filter, then applying a more expensive exact verification algorithm to the strings that pass the filter. Correspondingly, many string filters have been proposed. We note that different filters are good at eliminating … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 24 publications
(47 reference statements)
0
2
0
Order By: Relevance
“…Another related problem, Approximate string match, refers to the problem of matching a string or sub-string to a given pattern in a text. There have also been a lot of studies on this problem [24] [27], and Navarro gives a detailed analysis on the existing approaches in his survey [14]. The selectivity estimation of similarity search and similarity join in [3][4][5] [28].…”
Section: Related Workmentioning
confidence: 99%
“…Another related problem, Approximate string match, refers to the problem of matching a string or sub-string to a given pattern in a text. There have also been a lot of studies on this problem [24] [27], and Navarro gives a detailed analysis on the existing approaches in his survey [14]. The selectivity estimation of similarity search and similarity join in [3][4][5] [28].…”
Section: Related Workmentioning
confidence: 99%
“…Related to his work on XML as well as Information Extraction, Naughton and his students worked on various problems in searching and combining textual data in databases. This includes work on combining keyword search results with forms [144,149], approximate string membership [157,160], and debugging of "why not" provenance in keyword search over databases [182].…”
Section: Text Search In Databases (2009-2015)mentioning
confidence: 99%