Patent US5926652A successfully refreshed from Google Patents.
US5926652A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Matching of wild card patterns to wild card strings associated with named computer objects
Assignee: Google LLC
•
Filing: 1996-12-20
•
Granted: 1999-07-20
•
Expires: 2016-12-20
Abstract
Abstract method of matching computer wild card patterns involves comparing first and second character strings associated with named objects residing on a computer system to determine whether the first character string defines a first group of computer objects which is a logical subset of a second group of computer objects defined by the second character string. The first character string is provided by a user; such as in a command line, and the second character string is pre-defined, such as by a network administrator. The method can be performed by examining whether the second character string has any wild card character which can substitute for one and only one character, or by examining whether the second character string has any wild card character which can substitute for any number of characters, including no characters (a universal character). The second character string can further be examined to see if it contains any embedded sequence of characters having no universal wild card character.
Inventors
- 👤 Frederick J. Reznak
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:56
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90344; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
84 words
A method of comparing first and second character strings associated with computer objects residing in a computer system, wherein the computer objects are selected from the group consisting of computer devices, directories, sub-directories, files, and symbolic links, each of the character strings having at least one wild card character, comprising the step of determining whether the first character string defines a first group of computer objects which is a logical subset of a second group of computer objects defined by the second character string.
Claim 2
Independent Claim
84 words
A method of comparing first and second character strings associated with computer objects residing in a computer system, wherein the computer objects are selected from the group consisting of computer devices, directories, sub-directories, files, and symbolic links, each of the character strings having at least one wild card character, comprising the step of determining whether the first character string defines a first group of computer objects which is a logical subset of a second group of computer objects defined by the second character string.
Claim 3
Dependent Claim
22 words
The method of claim 1 wherein the first character string is provided by a user and the second character string is pre-defined.
Claim 4
Dependent Claim
33 words
The method of claim 1 wherein said determining step includes the step of examining whether the second character string has any wild card character which can substitute for one and only one character.
Claim 5
Dependent Claim
35 words
The method of claim 1 wherein said determining step includes the step of examining whether the second character string has any wild card character which can substitute for any number of characters, including no characters.
Claim 6
Dependent Claim
41 words
The method of claim 1 wherein said determining step includes the step of examining whether the second character string contains any specific sequence of characters having no wild card character which can substitute for any number of characters, including no characters.
Claim 7
Dependent Claim
42 words
The method of claim 1 wherein the comparison is performed by a set of software instructions which provide an indication that the first character string matches the second character string if said first group is a logical subset of said second group.
Claim 8
Dependent Claim
36 words
The method of claim 3 wherein said determining step further includes the step of examining whether the second character string has any wild card character which can substitute for any number of characters, including no characters.
Claim 9
Dependent Claim
42 words
The method of claim 3 wherein said determining step further includes the step of examining whether the second character string contains any specific sequence of characters having no wild card character which can substitute for any number of characters, including no characters.
Claim 10
Dependent Claim
42 words
The method of claim 4 wherein said determining step further includes the step of examining whether the second character string contains any specific sequence of characters having no wild card character which can substitute for any number of characters, including no characters.
Claim 11
Dependent Claim
42 words
The method of claim 7 wherein said determining step further includes the step of examining whether the second character string contains any specific sequence of characters having no wild card character which can substitute for any number of characters, including no characters.
Claim 12
Dependent Claim
97 words
A computer system comprising: a processor; a plurality of computer objects residing on one or more devices connected to said processor, said computer objects each having a unique name; and memory means connected to said processor for storing program instructions to determine whether a first character string, which has at least one wild card character and defines a first group of names associated with said computer objects, is a logical subset of a second character string which also has at least one wild card character and defines a second group of names associated with said computer objects.
Claim 13
Dependent Claim
97 words
A computer system comprising: a processor; a plurality of computer objects residing on one or more devices connected to said processor, said computer objects each having a unique name; and memory means connected to said processor for storing program instructions to determine whether a first character string, which has at least one wild card character and defines a first group of names associated with said computer objects, is a logical subset of a second character string which also has at least one wild card character and defines a second group of names associated with said computer objects.
Claim 14
Dependent Claim
28 words
The computer system of claim 11 wherein: one of the devices is a permanent storage device; and the computer objects are files residing on said permanent storage device.
Claim 15
Dependent Claim
13 words
The computer system of claim 11 wherein the computer objects are individual devices.
Claim 16
Dependent Claim
34 words
The computer system of claim 11 wherein: the computer system is a multi-user network; and said first character string is provided by a user of said network; and said second character string is pre-defined.
Claim 17
Dependent Claim
33 words
The computer system of claim 11 wherein said program instructions include instructions for examining whether said second character string has any wild card character which can substitute for one and only one character.
Claim 18
Dependent Claim
36 words
The computer system of claim 15 wherein said program instructions further include instructions for examining whether said second character string has any wild card character which can substitute for any number of characters, including no characters.
Claim 19
Dependent Claim
42 words
The computer system of claim 16 wherein said program instructions further include instructions for examining whether said second character string contains any specific sequence of characters having no wild card character which can substitute for any number of characters, including no characters.
References Cited (Backward Citations)
US4450520A
Cited
US4489435A
Cited
US4674066A
Cited
US4550436A
Cited
US4955056A
Cited
US5303150A
Cited
US5260778A
Cited
US5392428A
Cited
US5555343A
Cited
US5510981A
Cited
US5442699A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-07-19 | 2003-01-18 | 2003-07-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-07-19 | 2007-01-18 | 2007-07-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-07-19 | 2011-01-18 | 2011-07-20 | $7700.00 | Window Closed / Lapsed |