Patent US4209597A successfully refreshed from Google Patents.
Patent US6055527A successfully refreshed from Google Patents.
US6055527A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System, method and computer program product for superimposing attributes on hierarchically organized file systems
Assignee: McAfee LLC
•
Filing: 1998-05-08
•
Granted: 2000-04-25
•
Expires: 2018-05-08
Abstract
Abstract A method for superimposing attributes on files stored in a hierarchically organized file system, having at least one file and at least one directory, is disclosed. The method initializes an attribute data base (ADB) with one or more entries having a path descriptor referencing a file in a hierarchical database, an attribute, and an attribute association option describing how the attribute is associated with the file referenced by the path descriptor. The method simplifies maintaining systems employing file attributes to describe files by using the hierarchy of the file system to superimpose attributes on the files. The method provides for handling explicit, implicit, and static associations of attributes with files in the file hierarchy. The method is invoked by a file manager, such as an attribute supplying file hierarchy (ASFH), which resides in the operating system of a computer system having a processor, memory, and a system bus for passing data between the processor and memory. The method can be part of a Hierarchical Attribute Superimposition Subsystem (HASS) which includes an ADB and an ASFH.
Inventors
- 👤 M. Lee Badger
- 👤 Daniel F. Sterne
- 👤 David L. Sherman
- 👤 Homayoon Tajalli
- 👤 David I. Dalva
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 13:36
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/10; Y; Y10; Y10S; Y10S707/00; Y10S707/953; Y10S707/956; Y10S707/99931; Y10S707/99932; Y10S707/99951; Y10S707/99952; Y10S707/99953
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
165 words
A method for interacting with a computer's operating system to superimpose attributes on the computer's hierarchically organized file system, comprising the steps of: (1) interacting with an application program running on the computer to receive one of a plurality of hierarchically attribute superimposition subsystem (HASS) operations, wherein said one of the plurality of HASS operations specifies a file node or a directory node within the hierarchically organized file system; (2) invoking one of a plurality of attribute database (ADB) operations, wherein said one of the plurality of ADB operations references attribute association information for said file node or said directory node; and (3) invoking one of a plurality of attribute supplying file hierarchy (ASFH) operations, wherein said one of the plurality of ASFH operations physically interacts with the computer's operating or hierarchically organized file system to accomplish said one of the plurality of HASS operations; wherein said steps (1) to (3) allow attributes to be arbitrarily associated with said file node or said directory node.
Claim 2
Independent Claim
165 words
A method for interacting with a computer's operating system to superimpose attributes on the computer's hierarchically organized file system, comprising the steps of: (1) interacting with an application program running on the computer to receive one of a plurality of hierarchically attribute superimposition subsystem (HASS) operations, wherein said one of the plurality of HASS operations specifies a file node or a directory node within the hierarchically organized file system; (2) invoking one of a plurality of attribute database (ADB) operations, wherein said one of the plurality of ADB operations references attribute association information for said file node or said directory node; and (3) invoking one of a plurality of attribute supplying file hierarchy (ASFH) operations, wherein said one of the plurality of ASFH operations physically interacts with the computer's operating or hierarchically organized file system to accomplish said one of the plurality of HASS operations; wherein said steps (1) to (3) allow attributes to be arbitrarily associated with said file node or said directory node.
Claim 3
Dependent Claim
44 words
The method of claim 1, wherein step (1) comprises the step of: receiving one of the following of said plurality of HASS operations: (i) file -- create( ); (ii) link -- create( ); (iii) link -- delete( ); and (iv) get -- attributes( ).
Claim 4
Dependent Claim
39 words
The method of claim 1, wherein step (2) comprises the step of: receiving one of the following of said plurality of ADB operations: (i) get -- attributes( ); (ii) set -- attributes( ); and (iii) delete -- association( ).
Claim 5
Dependent Claim
50 words
The method of claim 1, wherein step (3) comprises the step of: receiving one of the following of said plurality of ASFH operations: (i) file -- create( ); (ii) link -- create( ); (iii) link -- delete( ); (iv) get -- attributes( ); (v) move( ); and (vi) rename( ).
Claim 6
Independent Claim
203 words
A system for superimposing attributes on the computer's hierarchically organized file system hierarchically attribute superimposition subsystem method comprising: an ADB; an ASFH; a HASS, wherein said HASS comprises: receiving means for receiving a HASS operation request containing one or more parameters; determining means for determining if said received HASS operation request is one of the following: (i) file -- create( ); (ii) link -- create( ); (iii) link -- delete( ); and (iv) get -- attributes( ); and responding means, responsive to said determining means, for responding to said received HASS operation request, wherein said responding means comprises: first creating means for creating a file specified by said parameters in said ASFH and updates said ADB if said received HASS operation request is said file -- create( ) operation; second creating means for creating a link in said ASFH and updates the ADB if said received HASS operation request is said link -- create( ) operation; deleting means for deleting the link from said ASFH if said received HASS operation request is said link -- delete( ) operation; and retrieving means for retrieving attributes, specified by said parameters, from said ADB if said received HASS operation is said get -- attributes( ) operation.
Claim 7
Independent Claim
203 words
A system for superimposing attributes on the computer's hierarchically organized file system hierarchically attribute superimposition subsystem method comprising: an ADB; an ASFH; a HASS, wherein said HASS comprises: receiving means for receiving a HASS operation request containing one or more parameters; determining means for determining if said received HASS operation request is one of the following: (i) file -- create( ); (ii) link -- create( ); (iii) link -- delete( ); and (iv) get -- attributes( ); and responding means, responsive to said determining means, for responding to said received HASS operation request, wherein said responding means comprises: first creating means for creating a file specified by said parameters in said ASFH and updates said ADB if said received HASS operation request is said file -- create( ) operation; second creating means for creating a link in said ASFH and updates the ADB if said received HASS operation request is said link -- create( ) operation; deleting means for deleting the link from said ASFH if said received HASS operation request is said link -- delete( ) operation; and retrieving means for retrieving attributes, specified by said parameters, from said ADB if said received HASS operation is said get -- attributes( ) operation.
Claim 8
Dependent Claim
221 words
A computer program product comprising a computer usable medium having computer readable program code means embodied in said medium for causing an application program to execute on a computer that provides a system for managing a plurality of files each of which is capable of being referenced by a plurality of hardlinks, said computer readable program code means comprising: a first computer readable program code means for causing the computer to maintain a database having stored therein a plurality of attribute association entries each having a path descriptor, an attribute, and an association option having a value of implicit; a second computer readable program code means for causing the computer to receive a database operation request specifying a path descriptor referencing a file; a third computer readable program code means for causing the computer to determine if there is an entry in said database having an association option having a value of implicit, and also having a path descriptor matching a longest prefix of said path descriptor referencing said file; and a fourth computer readable program code means for causing the computer to return an attribute of said entry if said path descriptor of said entry matches said longest prefix of said path descriptor referencing said file, and also if said entry has an association option having a value of implicit.
Claim 9
Dependent Claim
221 words
A computer program product comprising a computer usable medium having computer readable program code means embodied in said medium for causing an application program to execute on a computer that provides a system for managing a plurality of files each of which is capable of being referenced by a plurality of hardlinks, said computer readable program code means comprising: a first computer readable program code means for causing the computer to maintain a database having stored therein a plurality of attribute association entries each having a path descriptor, an attribute, and an association option having a value of implicit; a second computer readable program code means for causing the computer to receive a database operation request specifying a path descriptor referencing a file; a third computer readable program code means for causing the computer to determine if there is an entry in said database having an association option having a value of implicit, and also having a path descriptor matching a longest prefix of said path descriptor referencing said file; and a fourth computer readable program code means for causing the computer to return an attribute of said entry if said path descriptor of said entry matches said longest prefix of said path descriptor referencing said file, and also if said entry has an association option having a value of implicit.
Claim 10
Dependent Claim
50 words
The computer program product of claim 6, further comprising: a fifth computer readable program code means for causing the computer to initialize said database with an initialization entry having a initial path descriptor, an initial attribute, and an initial association option having a value of one of explicit and implicit.
Claim 11
Dependent Claim
70 words
The computer program product of claim 6, further comprising: a fifth computer readable program code means for causing the computer to detect instances where a particular file of said plurality of files has a different attribute or attributes corresponding to a plurality of hardlinks referencing said particular file; and a sixth computer readable program code means for causing the computer to report said instances in response to a user request.
Claim 12
Dependent Claim
45 words
The computer program product of claim 6, further comprising: a fifth computer readable program code means for causing the computer to return an error if no entry in said database has a path descriptor matching said longest prefix of said path descriptor referencing said file.
Claim 13
Dependent Claim
277 words
A computer program product comprising a computer usable medium having computer readable program code means embodied in said medium for causing an application program to execute on a computer that provides a system for managing a plurality of files each of which is capable of being referenced by a plurality of hardlinks, said computer readable program code means comprising: a first computer readable program code means for causing the computer to maintain a database having stored therein a plurality of entries each having a path descriptor, an attribute, and an association option having a value of implicit; a second computer readable program code means for causing the computer to receive a database operation request specifying a path descriptor referencing a file, an attribute to be attributed to said file, and an association option for said attribute to be attributed to said file; a third computer readable program code means for causing the computer to determine if there is an entry in said database having an association option having a value of implicit, and also having a path descriptor matching said path descriptor referencing said file; and a fourth computer readable program code means for causing the computer to add into said database an attribute association entry having a path descriptor equal to said path descriptor referencing said file, an attribute equal to said attribute to be attributed to said file, and an association option equal to said association option for said attribute to be attributed to said file if there is no entry in said database having an association option having a value of implicit, and having a path descriptor matching said path descriptor referencing said file.
Claim 14
Dependent Claim
277 words
A computer program product comprising a computer usable medium having computer readable program code means embodied in said medium for causing an application program to execute on a computer that provides a system for managing a plurality of files each of which is capable of being referenced by a plurality of hardlinks, said computer readable program code means comprising: a first computer readable program code means for causing the computer to maintain a database having stored therein a plurality of entries each having a path descriptor, an attribute, and an association option having a value of implicit; a second computer readable program code means for causing the computer to receive a database operation request specifying a path descriptor referencing a file, an attribute to be attributed to said file, and an association option for said attribute to be attributed to said file; a third computer readable program code means for causing the computer to determine if there is an entry in said database having an association option having a value of implicit, and also having a path descriptor matching said path descriptor referencing said file; and a fourth computer readable program code means for causing the computer to add into said database an attribute association entry having a path descriptor equal to said path descriptor referencing said file, an attribute equal to said attribute to be attributed to said file, and an association option equal to said association option for said attribute to be attributed to said file if there is no entry in said database having an association option having a value of implicit, and having a path descriptor matching said path descriptor referencing said file.
Claim 15
Dependent Claim
347 words
The computer program product of claim 10, further comprising: a fifth computer readable program code means for causing the computer to determine whether said association option for said attribute to be attributed to said file has a value of implicit or explicit; a sixth computer readable program code means for causing the computer to determine if there is an entry in said database having a path descriptor matching said path descriptor referencing said file, and also having an association option having a value of explicit; a seventh computer readable program code means for causing the computer to add an attribute association entry having a path descriptor equal to said path descriptor referencing said file, an attribute equal to said attribute to be attributed to said file, and an association option equal to said association option for said attributes to be attributed to said file if there is no entry in said database having a path descriptor exactly matching said path descriptor referencing said file, and having an association option equal to explicit; and an eighth computer readable program code means for causing the computer to replace an attribute association entry, determined by said sixth computer readable program code means to have a path descriptor matching said path descriptor referencing said file and to have an association option having a value of explicit, with an attribute association entry having a path descriptor equal to said path descriptor referencing said file, an attribute equal to said attribute to be attributed to said file, and an association option for said attribute to be attributed to said file. wherein said third computer readable program code means is performed only if it is determined by said fifth computer readable program code means that said association option for said attribute to be attributed to said file has a value of implicit, and wherein said sixth computer readable program code means is performed only if it is determined by said fifth computer readable program code means that said association option for said attribute to be attributed to said file has a value of explicit.
Claim 16
Dependent Claim
74 words
The computer program product of claim 11, wherein said eighth computer readable program code means is performed only if an attribute association entry is determined by said sixth computer readable program code means to have a path descriptor matching said path descriptor referencing said file, and an association option having a value of explicit, and said attribute association entry does not have an attribute that matches said attribute to be attributed to said file.
Claim 17
Dependent Claim
49 words
The computer program product of claim 10, further comprising: a fifth computer readable program code means for causing the computer to return an error if there is no entry having a path descriptor exactly matching said path descriptor referencing said file, and having an association option equal to implicit.
Claim 18
Dependent Claim
113 words
The computer program product of claim 10, further comprising: a fifth computer readable program code means for causing the computer to determine if there is an entry having a path descriptor matching a longest prefix of said path descriptor referencing said file, and having an attribute that matches said attribute to be attributed to said file; wherein said third computer readable program code means is performed only if there is no entry determined in said fifth computer readable program code means to have a path descriptor matching said longest path descriptor of said path descriptor referencing said file, and to have an attribute that matches said attribute to be attributed to said file.
Claim 19
Dependent Claim
54 words
The computer program product of claim 11, further comprising: a ninth computer readable program code means for causing the computer to initialize said database with an initialization entry having a initial path descriptor, an initial attribute, and an initial association option having a value of one of explicit, implicit, static implicit, and static explicit.
Claim 20
Dependent Claim
60 words
The computer program product of claim 11, wherein said fourth computer readable program code means, said seventh computer readable program code means, and said eighth computer readable program code are performed only if said entry having a path descriptor matching said path descriptor matching referencing said file does not have an attribute association equal to static explicit or static implicit.
Claim 21
Dependent Claim
70 words
The computer program product of claim 10, further comprising: a fifth computer readable program code means for causing the computer to detect instances where a particular file of said plurality of files has a different attribute or attributes corresponding to a plurality of hardlinks referencing said particular file; and a sixth computer readable program code means for causing the computer to report said instances in response to a user request.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-04-25 | 2003-10-25 | 2004-04-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-04-25 | 2007-10-25 | 2008-04-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-04-25 | 2011-10-25 | 2012-04-25 | $7700.00 | Window Closed / Lapsed |