Matching of wild card patterns to wild card strings associated with named computer objects

• US 5,926,652 A
• Filed: 12/20/1996
• Issued: 07/20/1999
• Est. Priority Date: 12/20/1996
• Status: Expired due to Term

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Reznak, Frederick J.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): Vu, Viet
• Application Number:
  US08/770,969
• Time in Patent Office: 942 Days
• Field of Search: 395/898, 395/899, 395/186, 395/187.01, 704/2, 704/3, 704/4, 704/5, 707/1, 707/3, 707/4, 707/5, 707/6
• US Class Current: 712/300
• CPC Class Codes: G06F 16/90344 by using string matching techniques
• CPC Class Codes: Y10S 707/99936 Pattern matching access

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.

Claims

1. 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.

2. The method of claim 1 wherein the first character string is provided by a user and the second character string is pre-defined.

3. 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.

4. 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.

5. 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.

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

11. 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.

12. 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.

13. The computer system of claim 11 wherein the computer objects are individual devices.

14. 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.

15. 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.

16. 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.

17. 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.