Multiple string search method
July 22, 2019. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesData processing system having a memory using object-based information and a protection scheme for determining access rights to such information Method and apparatus for data hashing using selection from a table of random numbers in combination with folding and bit manipulation of the selected random numbers Data base management system for real-time applications Methods and apparatus for decontaminating hash tables Apparatus and method for displaying data communication network configuration after searching the network Data compression/decompression method and apparatus Methods and apparatus for information storage and retrieval utilizing a method of hashing and different collision avoidance schemes depending upon clustering in the hash table Method and system for effectively representing query results in a limited amount of memory Method and system for object oriented notification System and process for application-level flow connection of data processing networks Patent #: 6226267 InventorsAssigneeApplicationNo. 358976 filed on 07/22/1999US Classes:707/1, DATABASE OR FILE ACCESSING707/6, Pattern matching access707/7, Sorting711/163, Access limiting712/228, Context preserving (e.g., context swapping, checkpointing, register windowing719/315Object oriented messageExaminersPrimary: Alam, Hosain T.Assistant: Alam, Shahid Attorney, Agent or FirmInternational ClassG06F 017/30Foreign Application Priority Data1998-09-04 GBAbstractA data processing system has a searching mechanism for finding occurrences of a plurality of key strings within a target string. The searching mechanism forms a hash value from each of the key strings, and adds each key string to a collection of key strings having the same hash value. It then selects a plurality of symbol positions in the target string, and forms a hash value at each selected symbol position in the target string. This hash value is used to select one of the collections of key strings. Each key string in the selected collection of key strings is then compared with the target string.Field of SearchMarket analysis, demand forecasting or surveyingAccess augmentation or optimizing Query processing (i.e., searching) Query formulation, input preparation, or translation Query augmenting and refining (e.g., inexact access) DATABASE OR FILE ACCESSING Pattern matching access Sorting Distributed or remote access FILE OR DATABASE MAINTENANCE Context preserving (e.g., context swapping, checkpointing, register windowing Processing sequence control (i.e., microsequencing) Access limiting | |
