专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07756847B2 Method and arrangement for searching for strings 失效
标题翻译：用于搜索字符串的方法和布置
公开(公告)号：US07756847B2
公开(公告)日：2010-07-13
申请号：US10547328
申请日：2004-02-25
申请人： Steffen Clarence Pauws , Sebastian Egner , Johannes Henricus Maria Korst , Marcel Van Vuuren
发明人： Steffen Clarence Pauws , Sebastian Egner , Johannes Henricus Maria Korst , Marcel Van Vuuren
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
摘要翻译：本发明涉及在包括许多长字符串或长字符串的数据库（80）中搜索具有与查询字符串（34）的部分或精确匹配的最终数量的结果字符串（30-33）的方法，所述数据库方法包括以下步骤：在第一数量的输入查询字符串（35,36,37）中划分查询字符串; 为所述第一数量的输入查询串中的每个字符串确定第二数量的相邻串（38-41,42-45,44-49），其中所述第二数量的相邻串中的每个字符串具有预定的第一数量错误; 基于搜索方法在所述第二数量的相邻串中搜索所述数据库中的每个字符串的第三数量的精确匹配（50-61,70-74）; 将所述搜索到的完全匹配的字符串从数据库连接成第四数量的中间字符串（29,30,32,33,34），其中包括在每个所述中间字符串中的所述所搜索的精确匹配字符串（50-61,70-74）是在所述数据库中彼此相继; 以及基于所述第四数量的中间字符串确定结果串（30-33）的最终数量，其中最终数量的结果串中的每个字符串与所述查询字符串（34）相比具有预定的第二数量的错误的最大值。这使得能够完全匹配或仅包含相对于所述查询字符串的次要错误的部分匹配，以及对于处理能力较低的较大数据库中的快速搜索。

2. 发明申请

US20060179052A1 Method and arrangement for searching for strings 失效
标题翻译：用于搜索字符串的方法和布置
公开(公告)号：US20060179052A1
公开(公告)日：2006-08-10
申请号：US10547328
申请日：2004-02-25
申请人： Steffen Pauws , Sebastian Egner , Johannes Korst , Marcel Van Vuuren
发明人： Steffen Pauws , Sebastian Egner , Johannes Korst , Marcel Van Vuuren
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： This invention relates to methods of searching for a final number of result strings (30-33) having a partial or an exact match with a query string (34) in a database (80) comprised of many long strings or a long string, said method includes the steps of partitioning the query string in a first number of input query strings (35, 36, 37); determining a second number of neighboring strings (38-41, 42-45, 44-49, respectively) for each string in said first number of input query strings, wherein each string in said second number of neighboring strings has a predetermined first number of errors; searching the database for a third number of exact matches (50-61, 70-74) for each string in said second number of neighboring strings based on a search method; concatenating said searched exact matched strings from the database into a fourth number of intermediate strings (29, 30, 32, 33, 34) wherein said searched exact matched strings (50-61, 70-74) comprised in each of said intermediate strings are in succession to one another in said database; and determining the final number of result strings (30-33) based in said fourth number of intermediate strings, wherein each string in the final number of result strings has a maximum of predetermined second number of errors compared to said query string (34). This enables for a perfect match or a partial match containing only minor errors with respect to said query string, and for a fast search in larger databases with a relative low use of processing power.
摘要翻译：本发明涉及在包括许多长字符串或长字符串的数据库（80）中搜索具有与查询字符串（34）的部分或精确匹配的最终数量的结果字符串（30-33）的方法，所述数据库方法包括以下步骤：在第一数量的输入查询字符串（35,36,37）中划分查询字符串; 确定所述第一数量的输入查询字符串中的每个字符串的第二数量的相邻串（38-41,42-45,44-49），其中所述第二数量的相邻串中的每个字符串具有预定的第一数量错误; 基于搜索方法在所述第二数量的相邻串中搜索所述数据库中的每个字符串的第三数量的精确匹配（50-61,70-74）; 将所述搜索到的完全匹配的字符串从数据库连接成第四数量的中间字符串（29,30,32,33,34），其中包括在每个所述中间字符串中的所述所搜索的精确匹配字符串（50-61,70-74）是在所述数据库中彼此相继; 以及基于所述第四数量的中间字符串确定结果字符串（30-33）的最终数量，其中与所述查询字符串（34）相比，最终数量的结果字符串中的每个字符串具有预定的第二数量的错误的最大值。这使得能够完全匹配或仅包含相对于所述查询字符串的次要错误的部分匹配，并且对于在相对较低使用处理能力的较大数据库中进行快速搜索。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式