Browse Prior Art Database

High Speed Text Retrieval

IP.com Disclosure Number: IPCOM000060832D
Original Publication Date: 1986-May-01
Included in the Prior Art Database: 2005-Mar-09

Publishing Venue

IBM

Related People

Authors:
Wakabayashi, S [+details]

Abstract

This article describes a text retrieval system using a new pattern- matching algorithm of a cellular type in which a plurality of matching units are arranged in a linear array with a first end receiving an input character string and a second end receiving in an opposite direction a pattern including one or more special characters in addition to normal characters. In the present system, the input character string is constructed by a character set S = {a0, a1, ..., an} consisting of, for example, EBCDIC characters or ASCII characters. The pattern P may include special characters, such as ?, *, @, -, and e, in addition to the characters in S. The present system adopts the following matching rules (R1-R6) in which "a" represents any single character in S and "b" represents any single character in S, or ?, or -a.