Resource efficient handling change notifications in graph structures
US8321430B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 4, 2009 |
| Grant date | Nov 27, 2012 |
| Priority date | — |
| Expiry date | Jan 23, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/34
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and apparatus for handling a data structure in a computerized system, the data structure comprising a first object having content and a second object having content, and interdependencies between the first object and the second object, the method comprising: receiving a description of the data structure; creating a graph structure indicating the interdependencies between the objects, the graph structure comprising at least a first vertex and a second vertex, the first vertex and the second vertex connected by an edge; and associating the first vertex with content of the first object and the second vertex with content of the second object, wherein the first vertex and the second vertex do not contain the content of the first object or the second object.In some embodiments, an application executed by computing platforms in a cluster comprising symmetrical nodes, statically registers relevant filters with every node in the cluster, and registers to the filter upon loading. When an event occurs in a node, only if the event passes any of the filters it is transferred to the other nodes in the cluster. In each of the other nodes, components are invalidated by traversing the depe…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.