Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and arrangement for searching for strings

A query string and substring technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as no good results, and achieve the effect of fast processing capacity

Inactive Publication Date: 2009-11-04
KONINK PHILIPS ELECTRONICS NV
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This happens because both the query string entered into the lookup attempt and the resulting match string may have small errors, but getting a partial match is still better than no result at all

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and arrangement for searching for strings
  • Method and arrangement for searching for strings
  • Method and arrangement for searching for strings

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] Throughout the drawings, the same reference numerals indicate similar or corresponding features, functions, strings, etc.

[0036] figure 1 Shown is a general description of the prior art. The figure shows the query string "abacababc" looked up in the string database referenced 80 . It shows four approximately matching database locations for the query string that allow at most one error (k=1). The query string "abacababc", referenced 34, consists of the three-letter list {'a', 'b', 'c'}. If only one error is allowed (k=1), it can be found that: approximate matches containing added symbols (for example, reference numeral 30: "abacadabbc"), approximate matches containing deleted symbols (for example, reference numeral 31: "abcababc") ”), approximate matches (eg, reference number 32: “abacadcbc”), and exact matches (eg, reference number 33 “abacababc”) including substitution symbols. In the prior art, it is usually necessary to specify the search string, so as to sear...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a method of finding a final number of result strings (30-33) that have a partial or exact match to a query string (34) in a database (80) consisting of a plurality of long strings or a long string, so that The method includes the steps of: dividing the query string into a first number of input query strings (35, 36, 37); determining a second number of adjacent strings for each string in the first number of input query strings (38 -41, 42-45, 44-49), wherein each of the second number of adjacent strings has a predetermined first number of errors; search the database based on the search method, for the second number of Each of the adjacent strings is searched for a third number of exact matches (50-61, 70-74); the exact matching strings found from the database are concatenated into a fourth number of intermediate strings (29, 30 , 32, 33, 34), wherein the searched exact matching strings (50-61, 70-74) contained in each of the intermediate strings are consecutive to each other in the database; and according to the The fourth number of intermediate strings determines a final number of result strings (30-33), wherein each string of the final number of result strings has a maximum predetermined second number of errors compared to the query string (34). This enables complete matches or partial matches containing small errors with respect to the query string, and enables fast lookups in larger databases using relatively low processing power.

Description

technical field [0001] The present invention relates to a method for searching the final number of result strings partially matching or exactly matching a query string in a database including many long strings or one long string. [0002] The invention also relates to a search engine. [0003] The invention also relates to a tool. [0004] The invention also relates to a computer system for carrying out the method. [0005] The invention further relates to a computer program product for carrying out the method. [0006] In addition, the invention further relates to a device. Background technique [0007] US5963957 discloses an information processing system with a music database. The music database stores monotone reference sequences of musical notes. These reference sequences are all normalized to the same scale degree for storage in the programmed order. A so-called N-ary is applied to find a match between an input string of notes and a specific reference sequence. T...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/30
CPCG06F17/30985G06F16/90344
Inventor S·伊格纳J·H·M·科斯特M·范沃尤伦S·C·波韦斯
Owner KONINK PHILIPS ELECTRONICS NV