Patent US6147687A successfully refreshed from Google Patents.
US6147687A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Dynamic and selective buffering tree view refresh with viewable pending notification
Assignee: International Business Machines Corp
•
Filing: 1998-10-02
•
Granted: 2000-11-14
•
Expires: 2018-10-02
Abstract
Abstract A method, system, and computer-readable code for decoupling data structure updates from a user-manipulable view of the data structure that is presented to the user in a graphical user interface. The data structure updates are buffered, and applied selectively, enabling the user to manipulate the data structure without interference from the update process. Preferably, the presentation of the items in the view indicates graphically that updates are pending (e.g. through use of a distinguishable font or icon). The update process may be triggered by user request, timer-driver means, or other user-configurable event(s). The update process may include use of one or more display filters, that serve to limit what is shown to the user in the resulting updated view. This filtering will be particularly useful for devices that have a limited amount of display space.
Inventors
- 👤 Michael Christian Wanderski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 10:30
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/01; G06F3/048; G06F3/0481; G06F16/00; G06F16/10; G06F16/16; G06F16/168; G06F16/20; G06F16/28; G06F16/289; G06F16/90; G06F16/901; G06F16/9027; G06F16/904; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/966
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
223 words
In a computing environment capable of having a connection to a network, computer readable code embodied on a computer-readable medium for decoupling data structure updates from a user-manipulable view of said data structure, comprising: computer-readable code means for storing a plurality of objects by a computer system in said computing environment; computer-readable code means for creating a hierarchical data structure representing a relationship among said plurality of objects; computer-readable code means for displaying a tree view of said hierarchical data structure on a graphical user interface of said computer system, wherein said displayed tree view represents said hierarchical data structure at a point in time and comprises a plurality of graphical objects; computer-readable code means for making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; computer-readable code means for buffering said corresponding updates for later application to said displayed tree view; computer-readable code means for enabling a user of said computer system to interact with said displayed tree view without interference from said computer-readable code means for making updates; computer-readable code means for detecting a container refresh action; computer-readable code means, responsive to said computer-readable code means for detecting, for applying said buffered updates to said displaced tree view, creating a refreshed tree view; and computer-readable code means for displaying said refreshed tree view.
Claim 2
Dependent Claim
223 words
In a computing environment capable of having a connection to a network, computer readable code embodied on a computer-readable medium for decoupling data structure updates from a user-manipulable view of said data structure, comprising: computer-readable code means for storing a plurality of objects by a computer system in said computing environment; computer-readable code means for creating a hierarchical data structure representing a relationship among said plurality of objects; computer-readable code means for displaying a tree view of said hierarchical data structure on a graphical user interface of said computer system, wherein said displayed tree view represents said hierarchical data structure at a point in time and comprises a plurality of graphical objects; computer-readable code means for making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; computer-readable code means for buffering said corresponding updates for later application to said displayed tree view; computer-readable code means for enabling a user of said computer system to interact with said displayed tree view without interference from said computer-readable code means for making updates; computer-readable code means for detecting a container refresh action; computer-readable code means, responsive to said computer-readable code means for detecting, for applying said buffered updates to said displaced tree view, creating a refreshed tree view; and computer-readable code means for displaying said refreshed tree view.
Claim 3
Dependent Claim
47 words
Computer readable code for decoupling data structure updates from a user-manipualable view of said data structure according to claim 1, wherein said computer-readable code means for buffering updates further comprises computer-readable code means for providing a visual indication to said user that said buffered updates are pending.
Claim 4
Dependent Claim
36 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 1, wherein said computer-readable code means for detecting a container refresh action detects a user-invoked refresh request.
Claim 5
Dependent Claim
36 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 1, wherein said computer-readable code means for detecting a container refresh action detects a timer-invoked refresh request.
Claim 6
Dependent Claim
46 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 1, wherein said computer-readable code means for applying said buffered updates further comprises computer-readable code means for applying an action filter when creating said refreshed tree view.
Claim 7
Dependent Claim
52 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 5, wherein said action filter specifies different processing to be performed for selected ones of said buffered updates, and wherein said computer-readable code means for applying said action filter applies said different processing.
Claim 8
Dependent Claim
62 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 5, wherein said action filter specifies that selected ones of said buffered updates are to be omitted from said displayed tree view, and wherein said computer-readable code means for applying said action filter omits said selected ones when creating said refreshed tree view.
Claim 9
Dependent Claim
52 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 1, wherein said computer-readable code means for making updates to said stored objects and said computer-readable code means for enabling said user to interact with said displayed tree view use separate execution threads.
Claim 10
Dependent Claim
35 words
Computer readable code for decoupling data structure updates from a user-manipulable view of said data structure according to claim 1, wherein said computer-readable code means for detecting a container refresh action detects a user-configured event.
Claim 11
Dependent Claim
192 words
A computer system for decoupling data structure updates from a user-manipulable view of said data structure in a computing environment capable of having a connection to a network, comprising: means for storing a plurality of objects by said computer system; means for creating a hierarchical data structure representing a relationship among said plurality of objects; means for displaying a tree view of said hierarchical data structure on a graphical user interface of said computer system, wherein said displayed tree view represents said hierarchical data structure at a point in time and comprises a plurality of graphical objects; means for making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; means for buffering said corresponding updates for later application to said displayed tree view; means for enabling a user of said computer system to interact with said displayed tree view without interference from said means for making updates; means for detecting a container refresh action; means, responsive to said means for detecting, for applying said buffered updates to said displayed tree view, creating a refreshed tree view, and means for displaying said refreshed tree view.
Claim 12
Dependent Claim
192 words
A computer system for decoupling data structure updates from a user-manipulable view of said data structure in a computing environment capable of having a connection to a network, comprising: means for storing a plurality of objects by said computer system; means for creating a hierarchical data structure representing a relationship among said plurality of objects; means for displaying a tree view of said hierarchical data structure on a graphical user interface of said computer system, wherein said displayed tree view represents said hierarchical data structure at a point in time and comprises a plurality of graphical objects; means for making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; means for buffering said corresponding updates for later application to said displayed tree view; means for enabling a user of said computer system to interact with said displayed tree view without interference from said means for making updates; means for detecting a container refresh action; means, responsive to said means for detecting, for applying said buffered updates to said displayed tree view, creating a refreshed tree view, and means for displaying said refreshed tree view.
Claim 13
Dependent Claim
42 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for buffering updates further comprises means for providing a visual indication to said user that said buffered updates are pending.
Claim 14
Dependent Claim
33 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for detecting a container refresh action detects a user-invoked refresh request.
Claim 15
Dependent Claim
33 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for detecting a container refresh action detects a timer-invoked refresh request.
Claim 16
Dependent Claim
41 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for applying said buffered updates further comprises means for applying an action filter when creating said refreshed tree view.
Claim 17
Dependent Claim
49 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 14, wherein said action filter specifies different processing to be performed for selected ones of said buffered updates, and wherein said means for applying said action filter applies said different processing.
Claim 18
Dependent Claim
59 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 14, wherein said action filter specifies that selected ones of said buffered updates are to be omitted from said displayed tree view, and wherein said means for applying said action filter omits said selected ones when creating said refreshed tree view.
Claim 19
Dependent Claim
47 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for making updates to said stored objects and said means for enabling said user to interact with said displayed tree view use separate execution threads.
Claim 20
Dependent Claim
32 words
The system for decoupling data structure updates from a user-manipulable view of said data structure according to claim 10, wherein said means for detecting a container refresh action detects a user-configured event.
Claim 21
Independent Claim
162 words
A method for decoupling data structure updates from a user-manipulable view of said data structure in a computer operating in a computing environment capable of having a connection to a network comprising the steps of: displaying a plurality of graphical objects on a graphical user interface of said computer system, wherein said graphical objects represent a tree view, at a point in time, of a hierarchical data structure representing a relationship among a plurality of objects stored by said computer system; making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; buffering said corresponding updates for later application to said displayed tree view; enabling a user of said computer system to interact with said displayed tree view without interference from said making updates step; detecting a container refresh action; applying, responsive to said detecting step, said buffered updates to said displayed tree view, creating a refreshed tree view; and displaying said refreshed tree view.
Claim 22
Independent Claim
162 words
A method for decoupling data structure updates from a user-manipulable view of said data structure in a computer operating in a computing environment capable of having a connection to a network comprising the steps of: displaying a plurality of graphical objects on a graphical user interface of said computer system, wherein said graphical objects represent a tree view, at a point in time, of a hierarchical data structure representing a relationship among a plurality of objects stored by said computer system; making updates to said stored objects by an executing application, necessitating corresponding updates to said hierarchical data structure; buffering said corresponding updates for later application to said displayed tree view; enabling a user of said computer system to interact with said displayed tree view without interference from said making updates step; detecting a container refresh action; applying, responsive to said detecting step, said buffered updates to said displayed tree view, creating a refreshed tree view; and displaying said refreshed tree view.
Claim 23
Dependent Claim
42 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said buffering updates step further comprises the step of providing a visual indication to said user that said buffered updates are pending.
Claim 24
Dependent Claim
32 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said detecting a container refresh action step detects a user-invoked refresh request.
Claim 25
Dependent Claim
32 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said detecting a container refresh action step detects a timer-invoked refresh request.
Claim 26
Dependent Claim
41 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said applying said buffered updates step further comprises the step of applying an action filter when creating said refreshed tree view.
Claim 27
Dependent Claim
48 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 23, wherein said action filter specifies different processing to be performed for selected ones of said buffered updates, and wherein said applying said action filter step applies said different processing.
Claim 28
Dependent Claim
58 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 23, wherein said action filter specifies that selected ones of said buffered updates are to be omitted from said displayed tree view, and wherein said applying said action filter step omits said selected ones when creating said refreshed tree view.
Claim 29
Dependent Claim
45 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said making updates to said stored objects step and said enabling said user to interact with said displayed tree view step use separate execution threads.
Claim 30
Dependent Claim
31 words
The method for decoupling data structure updates from a user-manipulable view of said data structure according to claim 19, wherein said detecting a container refresh action step detects a user-configured event.
Claim 31
Independent Claim
174 words
A method for providing a graphical display of a hierarchical data structure on a graphical user interface of a computing system, said method comprising steps of: displaying a tree view of said hierarchical data structure on said graphical user interface, wherein said displayed tree view comprises a plurality of graphical objects which represent stored objects of said hierarchical data structure and relationships among said stored objects at a point in time; making updates, by an executing application, to one or more of said stored objects; storing said updates in a buffer for delayed application to said displayed tree view; enabling a user of said computing system to interact with said displayed tree view without interference from said making updates step; detecting invocation of a container refresh action, wherein said container refresh action signifies that said displayed tree view is to be refreshed; applying one or more of said updates in said buffer, responsive to said detecting step, to said displayed tree view, thereby creating a refreshed tree view; and displaying said refreshed tree view.
Claim 32
Independent Claim
174 words
A method for providing a graphical display of a hierarchical data structure on a graphical user interface of a computing system, said method comprising steps of: displaying a tree view of said hierarchical data structure on said graphical user interface, wherein said displayed tree view comprises a plurality of graphical objects which represent stored objects of said hierarchical data structure and relationships among said stored objects at a point in time; making updates, by an executing application, to one or more of said stored objects; storing said updates in a buffer for delayed application to said displayed tree view; enabling a user of said computing system to interact with said displayed tree view without interference from said making updates step; detecting invocation of a container refresh action, wherein said container refresh action signifies that said displayed tree view is to be refreshed; applying one or more of said updates in said buffer, responsive to said detecting step, to said displayed tree view, thereby creating a refreshed tree view; and displaying said refreshed tree view.
Claim 33
Dependent Claim
38 words
The method according to claim 28, further comprising the step of providing a visual indicator on said graphical user interface when said buffer contains one or more updates that have not been applied to said displayed tree view.
References Cited (Backward Citations)
US5276789A
Cited
US5444842A
Cited
US5530855A
Cited
US6052688A
Cited
US5842216A
Cited
US5999926A
Cited
US5926816A
Cited
US5924094A
Cited
US6073137A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-11-14 | 2004-05-15 | 2004-11-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-11-14 | 2008-05-15 | 2008-11-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-11-14 | 2012-05-15 | 2012-11-14 | $7700.00 | Window Closed / Lapsed |