Fast substring fulltext search
Abstract:
A system includes receiving a substring to be searched and determining one or more N-grams associated with the received substring. A lookup of each of the one or more N-grams is performed using an N-gram index. A set of tokens associated with each of the one or more N-grams is calculated and a determination is made if the substring exits in the calculated set of tokens. The results of the determination if the substring exits in the set of tokens are outputted.
Public/Granted literature
Information query
Patent Agency Ranking
0/0