The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 27, 2012
Filed:
May. 04, 2009
Elisha Ben Zvi, Hod-Hasharon, IL;
Robert Krien, Moshav Beit Sheakim, IL;
Zohar Sheinberg, Tel-Aviv, IL;
Vitaly Vainer, Kfar-Saba, IL;
Elisha Ben Zvi, Hod-Hasharon, IL;
Robert Krien, Moshav Beit Sheakim, IL;
Zohar Sheinberg, Tel-Aviv, IL;
Vitaly Vainer, Kfar-Saba, IL;
SAP Portals Israel Ltd., Raanana, IL;
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 dependency graph.