Dismiss
InnovationQ will be updated on Sunday, September 22, from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

A PROCESS FOR EFFICIENT STRING MATCHING

IP.com Disclosure Number: IPCOM000007962D
Original Publication Date: 1996-Nov-01
Included in the Prior Art Database: 2002-May-08
Document File: 3 page(s) / 147K

Publishing Venue

Motorola

Related People

Authors:
James H. Tolar

Abstract

Applications in Computer Aided Design ofien require the ability to efficiently sort and search col- lections of character strings. Examples include pla minimization, simulation results analysis, testability tools, and various fault-grading applications. Sorting and searching arbitrarily long character strings is a computationally complex process that generally involves multiple passes over the data-set and thus imposes a heavy burden on the individual CAD appli- cation. This paper presents a single-pass process for identifying matching strings in a data-set consisting ofarbitrarily long character strings.