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

1. 发明申请

WO2004079631A3 METHOD AND ARRANGEMENT FOR SEARCHING FOR STRINGS 审中-公开
标题翻译：搜索字符串的方法和安排
公开(公告)号：WO2004079631A3
公开(公告)日：2004-10-28
申请号：PCT/IB2004050148
申请日：2004-02-25
申请人： KONINKL PHILIPS ELECTRONICS NV , PAUWS STEFFEN C , EGNER SEBASTIAN , KORST JOHANNES H M , VAN VUUREN MARCEL
发明人： EGNER SEBASTIAN , KORST JOHANNES H M , VAN VUUREN MARCEL
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

热门服务

关于我们

友情链接

联系方式