Patent US6108698A successfully refreshed from Google Patents.
US6108698A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Node-link data defining a graph and a tree within the graph
Assignee: SAP America Inc
•
Filing: 1998-07-29
•
Granted: 2000-08-22
•
Expires: 2018-07-29
Abstract
Abstract Node-link data defining a graph also include tree defining data. The node-link data with the tree defining data further define a tree within the graph. The tree defining data indicate a set of elements in the graph that are represented in the tree. Each of a subset of elements in the set is represented more than once in the tree. For at least one element in the subset, the tree defining data indicate which representations of the element have descendants in the tree and which representations have none. The tree defining data can, for example, be expansion flags for links in the graph that are in the set of elements, with each links expansion flag indicating whether the link's to-node is expanded or contracted in the tree. In response to each of a series of expand and contract signals from a user, an iteration can modify the tree defining data and use it to present a representation of the graph with the indicated node expanded or contracted as requested.
Inventors
- 👤 Tichomir G. Tenev
- 👤 Ramana B. Rao
- 👤 Harold J. Shinsato, Jr.
- 👤 John O. Lamping
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:30
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9024
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
114 words
A method of obtaining node-link data; the method comprising: (A) obtaining node-link data defining a graph; in which (A) comprises: obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
Claim 2
Independent Claim
114 words
A method of obtaining node-link data; the method comprising: (A) obtaining node-link data defining a graph; in which (A) comprises: obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
Claim 3
Dependent Claim
31 words
The method of claim 1 in which the tree defining data comprise expansion/contraction data indicating, for each link in the set of elements, whether the link's to-node is expanded or contracted.
Claim 4
Dependent Claim
30 words
The method of claim 2 in which the expansion/contraction data include, for each link in the set of elements, a flag indicating whether the link's to-node is expanded or contracted.
Claim 5
Dependent Claim
36 words
The method of claim 3 in which the expansion/contraction data include, for the incoming links of each node in the set of elements, at most one link with a flag indicating that the node is expanded.
Claim 6
Dependent Claim
37 words
The method of claim 1 in which the tree defining data indicate at most one representation of the element in the tree that has descendants, all other representations of the element in the tree having no descendants.
Claim 7
Dependent Claim
21 words
The method of claim 1 in which (A) further comprises a series of iterations, each iteration obtaining respective tree defining data.
Claim 8
Dependent Claim
47 words
The method of claim 6 in which each iteration comprises: receiving a navigation signal from a user; responding to the navigation signal by obtaining the iteration's tree defining data; and using the node-link data including the iteration's tree defining data to present a representation of the graph.
Claim 9
Dependent Claim
18 words
The method of claim 7 in which the navigation signal is an expand signal or a contract signal.
Claim 10
Dependent Claim
57 words
The method of claim 8 in which the navigation signal further indicates a node feature in the representation presented in the preceding iteration, the node feature representing a node in the graph, the representation further including a link feature leading to the node feature, the link feature representing an incoming link to the node in the graph.
Claim 11
Dependent Claim
58 words
The method of claim 9 in which the navigation signal is an expand signal, the act of obtaining the iteration's tree defining data comprising: modifying the previous iteration's tree defining data to indicate that the incoming link represented by the link feature is expanded and that all other incoming links to the node in the graph are contracted.
Claim 12
Dependent Claim
44 words
The method of claim 9 in which the navigation signal is a contract signal, the act of obtaining the iteration's tree defining data comprising: modifying the previous iteration's tree defining data to indicate that the incoming link represented by the link feature is contracted.
Claim 13
Dependent Claim
26 words
The method of claim 9 in which the node feature includes an indication of whether the node it represents is expanded or contracted in the tree.
Claim 14
Independent Claim
119 words
A system for obtaining node-link data, the system comprising: a processor for obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendant in the tree.
Claim 15
Independent Claim
119 words
A system for obtaining node-link data, the system comprising: a processor for obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendant in the tree.
Claim 16
Dependent Claim
172 words
An article of manufacture for use in a system that includes: a storage medium access device; and a processor connected for receiving data accessed on a storage medium by the storage medium access device; the article of manufacture comprising: a storage medium; and instruction data stored by the storage medium; the instruction data indicating instructions the processor can execute; the processor, in executing the instructions, obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
Claim 17
Dependent Claim
172 words
An article of manufacture for use in a system that includes: a storage medium access device; and a processor connected for receiving data accessed on a storage medium by the storage medium access device; the article of manufacture comprising: a storage medium; and instruction data stored by the storage medium; the instruction data indicating instructions the processor can execute; the processor, in executing the instructions, obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
Claim 18
Independent Claim
192 words
A method of transferring data between first and second machines over a network, the second machine including memory and a processor connected for accessing the memory; the memory being for storing instruction data; the method comprising: establishing a connection between the first and second machines over the network; and operating the first and second machines to transfer instruction data from the first machine to the memory of the second machine; the instruction data indicating instructions the processor can execute; the processor, in executing the instructions, obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
Claim 19
Independent Claim
192 words
A method of transferring data between first and second machines over a network, the second machine including memory and a processor connected for accessing the memory; the memory being for storing instruction data; the method comprising: establishing a connection between the first and second machines over the network; and operating the first and second machines to transfer instruction data from the first machine to the memory of the second machine; the instruction data indicating instructions the processor can execute; the processor, in executing the instructions, obtaining node-link data defining a graph; the processor, in obtaining the node-link data, obtaining tree defining data that are included in the node-link data; the node-link data with the tree defining data further defining a tree within the graph; the tree defining data indicating a set of elements in the graph that are represented in the tree; a subset of elements in the set being represented more than once in the tree; for at least one element in the subset, the tree defining data indicating which representations of the element have descendants in the tree and which representations of the element have no descendants in the tree.
References Cited (Backward Citations)
US5337404A
Cited
US5394556A
Cited
US5784557A
Cited
US5515487A
Cited
US5414836A
Cited
US5590250A
Cited
US5619632A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-08-22 | 2004-02-21 | 2004-08-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-08-22 | 2008-02-21 | 2008-08-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-08-22 | 2012-02-21 | 2012-08-22 | $7700.00 | Window Closed / Lapsed |