Patent US6018741A successfully refreshed from Google Patents.
US6018741A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for managing objects in a dynamic inheritance tree
Assignee: International Business Machines Corp
•
Filing: 1997-10-22
•
Granted: 2000-01-25
•
Expires: 2017-10-22
Abstract
Abstract A method and system for managing an index tree structure. The index tree structure has a root node and a plurality of child nodes. Each one of the root and child nodes has at least one attribute. Each child node is assigned to a respective parent node in the index tree structure. A request is received for the value of one of the attributes of one of the child nodes; the one attribute is not defined locally within the one child node. The current value of the corresponding attribute of the parent node of the one child node is provided, in response to the request.
Inventors
- 👤 Michael J. Howland
- 👤 Steven M. Pritko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 00:24
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9027; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
106 words
A method for managing an index tree structure which has a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, comprising the steps of: (a) assigning each child node to a respective parent node in the index tree structure; (b) receiving a request for the value of one of the attributes of one of the child nodes, wherein the one attribute is not defined locally within the one child node; and (c) providing the current value of the corresponding attribute of the parent node of the one child node, in response to the request.
Claim 2
Independent Claim
106 words
A method for managing an index tree structure which has a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, comprising the steps of: (a) assigning each child node to a respective parent node in the index tree structure; (b) receiving a request for the value of one of the attributes of one of the child nodes, wherein the one attribute is not defined locally within the one child node; and (c) providing the current value of the corresponding attribute of the parent node of the one child node, in response to the request.
Claim 3
Dependent Claim
42 words
The method according to claim 1, wherein at least one attribute of one of the child nodes is a locally defined attribute, further comprising the step of assigning a respective value to each locally defined attribute of each of the child nodes.
Claim 4
Dependent Claim
51 words
The method according to claim 1, wherein step (c) includes automatically providing an updated value of the one attribute of the one child node when the value of the one attribute is next requested after the value of the corresponding attribute of the parent node of the one child node changes.
Claim 5
Dependent Claim
81 words
The method according to claim 1, further comprising the steps of: (d) re-assigning the one child node to a new parent node, the new parent node being different from the parent node of step (c), the one child node having an inherited attribute which is not a locally defined attribute; and (e) automatically providing the current value of the inherited attribute of the new parent node when the value of the inherited attribute of the one child node is next requested.
Claim 6
Dependent Claim
45 words
The method according to claim 4, further comprising the steps of: assigning a respective value to each locally defined attribute of the one child node, before step (d); and keeping the values of each locally defined attribute of the one child node during step (e).
Claim 7
Independent Claim
119 words
A method for managing a plurality of data objects, each of the plurality of data objects having at least one attribute, at least one of the plurality of objects being identified as a parent of a child object, at least two of the plurality of objects being identified as child objects, the method comprising the steps of: (a) assigning each child object to a respective parent object; (b) identifying each attribute of each of the child objects as being either a locally defined attribute or an inherited attribute; and (c) dynamically assigning, to each inherited attribute of each one of the child objects, the current value of the corresponding attribute in the parent object of the one child object.
Claim 8
Independent Claim
119 words
A method for managing a plurality of data objects, each of the plurality of data objects having at least one attribute, at least one of the plurality of objects being identified as a parent of a child object, at least two of the plurality of objects being identified as child objects, the method comprising the steps of: (a) assigning each child object to a respective parent object; (b) identifying each attribute of each of the child objects as being either a locally defined attribute or an inherited attribute; and (c) dynamically assigning, to each inherited attribute of each one of the child objects, the current value of the corresponding attribute in the parent object of the one child object.
Claim 9
Dependent Claim
38 words
The method for managing a plurality of data objects according to claim 6, further comprising, between steps (b) and (c), the step of assigning a respective value to each locally defined attribute of each of the child objects.
Claim 10
Dependent Claim
23 words
The method for managing a plurality of data objects according to claim 7, wherein each object represents a task executed by a processor.
Claim 11
Dependent Claim
33 words
The method for managing a plurality of data objects according to claim 8, wherein at least one of the attributes of each object represents state data for the task represented by the object.
Claim 12
Dependent Claim
21 words
The method for managing a plurality of data objects according to claim 8, wherein the tasks are asynchronous from one another.
Claim 13
Dependent Claim
57 words
The method for managing a plurality of data objects according to claim 6, wherein one of the child objects has an inherited attribute, and step (c) includes automatically modifying the value of the inherited attribute of the one child object when the value of the corresponding attribute of the parent object of the one child object changes.
Claim 14
Dependent Claim
68 words
The method for managing a plurality of data objects according to claim 6, further comprising the steps of: (d) re-assigning one of the child objects to a new parent object, the new parent object being different from the parent object of step (a); and (e) automatically assigning to each inherited attribute of the re-assigned child object the current value of the corresponding attribute in the new parent object.
Claim 15
Dependent Claim
52 words
The method for managing a plurality of data objects according to claim 12, further comprising the steps of: assigning a respective value to each locally defined attribute of the one child object, before step (d); and keeping the values of each locally defined attribute of the one child object during step (e).
Claim 16
Independent Claim
103 words
A method for managing an index tree structure which has a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, comprising the steps of: (a) assigning each child node to a respective parent node in the index tree structure; (b) identifying each attribute of each of the child nodes as being either a locally defined attribute or an inherited attribute; and (c) dynamically assigning, to each inherited attribute of each one of the child nodes, the current value of the corresponding attribute in the parent node of the one child node.
Claim 17
Independent Claim
103 words
A method for managing an index tree structure which has a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, comprising the steps of: (a) assigning each child node to a respective parent node in the index tree structure; (b) identifying each attribute of each of the child nodes as being either a locally defined attribute or an inherited attribute; and (c) dynamically assigning, to each inherited attribute of each one of the child nodes, the current value of the corresponding attribute in the parent node of the one child node.
Claim 18
Dependent Claim
31 words
The method according to claim 14, further comprising, between steps (b) and (c), the step of assigning a respective value to each locally defined attribute of each of the child nodes.
Claim 19
Dependent Claim
57 words
The method according to claim 14, wherein one of the child nodes has an inherited attribute which is not a locally defined attribute, and step (c) includes automatically modifying the value of the inherited attribute of the one child node when the value of the corresponding attribute of the parent node of the one child node changes.
Claim 20
Dependent Claim
73 words
The method according to claim 14, wherein one of the child nodes has an inherited attribute, the method further comprising the steps of: (d) re-assigning one of the child nodes to a new parent node, the new parent node being different from the parent node of step (a); and (e) automatically assigning to each inherited attribute of the re-assigned child node the current value of the corresponding attribute in the new parent node.
Claim 21
Dependent Claim
45 words
The method according to claim 17, further comprising the steps of: assigning a respective value to each locally defined attribute of the one child node, before step (d); and keeping the values of each locally defined attribute of the one child node during step (e).
Claim 22
Independent Claim
103 words
A system for managing a plurality of data objects comprising: index tree means having a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, each child node being assigned to a respective parent node; means for receiving a request for the value of one of the attributes of one of the child nodes, wherein the one attribute is not defined locally within the one child node; and means for providing the current value of the corresponding attribute of the parent node of the one child node, in response to the request.
Claim 23
Independent Claim
103 words
A system for managing a plurality of data objects comprising: index tree means having a root node and a plurality of child nodes, each one of the root and child nodes having at least one attribute, each child node being assigned to a respective parent node; means for receiving a request for the value of one of the attributes of one of the child nodes, wherein the one attribute is not defined locally within the one child node; and means for providing the current value of the corresponding attribute of the parent node of the one child node, in response to the request.
Claim 24
Dependent Claim
56 words
The system according to claim 19, wherein the current value providing means include means for automatically providing an updated value of the one attribute of the one child node when the value of the one attribute is next requested after the value of the corresponding attribute of the parent node of the one child node changes.
Claim 25
Dependent Claim
67 words
The system according to claim 19, further comprising: means for re-assigning the one child node to a new parent node, the one child node having an inherited attribute which is not a locally defined attribute; and means for automatically providing the current value of the inherited attribute of the new parent node when the value of the inherited attribute of the one child node is next requested.
References Cited (Backward Citations)
US4344134A
Cited
US4410940A
Cited
US4754410A
Cited
US5307486A
Cited
US5063504A
Cited
US5063503A
Cited
US5528752A
Cited
US5325527A
Cited
US5781906A
Cited
US5897636A
Cited
US5850516A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-24 | 2003-07-26 | 2004-01-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-24 | 2007-07-26 | 2008-01-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-24 | 2011-07-26 | 2012-01-25 | $7700.00 | Window Closed / Lapsed |