Ranking nodes in a graph
First Claim
Patent Images
1. A method for updating importance rank of nodes in a dynamically changing large graph;
- the importance ranks are used by an application;
the graph includes links interconnecting the nodes;
the method comprising the steps of;
a. updating the importance rank of nodes in the graph substantially in real time during visit of nodes in the graph;
if said graph is not strongly connected, selectively applying corrective measures;
an order of visit of nodes is prescribed by an algorithm;
b. repeating step (a) as many times as required;
said updating of importance rank of step (a) is capable of being executed also when the graph is changing, and wherein an algorithm that governs the order of visit of nodes is not prescribed by said updating and applying correction steps.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for updating importance rank of Internet Web pages. The importance rank is used by an application. The Internet includes Hyper-links interconnecting the Web units. The method includes the step of updating the importance rank of Web pages in the internet in real time during visit of the Web pages, and applying corrective measures in order to render the graph strongly connected. Repeating the step as many times as required. The above updating of importance rank of step (a) is capable of being executed also when the Internet is changing.
-
Citations
39 Claims
-
1. A method for updating importance rank of nodes in a dynamically changing large graph;
- the importance ranks are used by an application;
the graph includes links interconnecting the nodes;
the method comprising the steps of;
a. updating the importance rank of nodes in the graph substantially in real time during visit of nodes in the graph;
if said graph is not strongly connected, selectively applying corrective measures;
an order of visit of nodes is prescribed by an algorithm;
b. repeating step (a) as many times as required;
said updating of importance rank of step (a) is capable of being executed also when the graph is changing,and wherein an algorithm that governs the order of visit of nodes is not prescribed by said updating and applying correction steps. - View Dependent Claims (2, 3, 4, 6)
- the importance ranks are used by an application;
-
5. A method for updating importance rank of Internet Web units in an Internet;
- the importance ranks are used by an application;
the Internet includes Hyper-links interconnecting the Web units;
the method comprising the steps of;
a) updating the importance rank of Web units in the internet substantially in real time during visit of the Web units; and
applying corrective measures;
an order of visit of nodes is prescribed by an algorithm;
b) repeating step (a) as many times as required;
said updating of importance rank of step (a) is capable of being executed also when the Internet is changing,and wherein an algorithm that governs the order of visit of nodes is not prescribed by said by said updating and applying correction steps. - View Dependent Claims (7, 8)
- the importance ranks are used by an application;
-
9. A method for updating importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the method comprising the steps of;
a. storing for each node in the graph at least;
i) short history indication representative of what happened to the node in terms of importance rank since last update;
ii) long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
b. visiting nodes in the graph;
c. for each visited node, updating the importance rank of nodes by performing the steps of;
i) in the case that said visited node has at least one child node, distributing at least substantial part of the short history indication of the visited node to the short history indication of the at least one child node;
ii) recording at least substantial part of the short history indication of the visited node to the long history indication of the visited node and designating that said recording has been accomplished. d. repeating steps (b) and (c) as many times as required;
said steps (b) to (d) are capable of being executed also when said graph is changing, and if said graph is not strongly connected selectively applying corrective measures. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17, 18)
- the graph includes links interconnecting the nodes;
-
19. A method for calculating the importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the method comprising the steps of;
a) providing for each node in the graph at least;
(i) short history indication representative of what happened to the node in terms of importance rank since last update;
(ii) long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
b) selecting node in the graph;
c) for selected node, computing the importance rank as a function of at least one of said short history indication and long history indication;
d) repeating steps (b) and (c) as many times as required. - View Dependent Claims (20, 21, 22, 23, 24, 25)
- the graph includes links interconnecting the nodes;
-
26. A system for updating importance rank of nodes in a dynamically changing large graph;
- the importance ranks are used by an application;
the graph includes links interconnecting the nodes;
the system comprising;
at least one processor and associated storage configured to perform the operations that include;
update the importance rank of nodes in the graph substantially in real time during visit of nodes in the graph; and
if said graph is not strongly connected, said processor is configured to selectively applying corrective measures;
the processor is configured to update said importance rank also when the graph is changing, and wherein an algorithm that governs the order of visiting of nodes is not prescribed by the processor update and corrective measures operations.
- the importance ranks are used by an application;
-
27. A system for updating importance rank of Web units in an Internet;
- the importance ranks are used by an application;
the Internet includes Hyper-links interconnecting the Web units;
the system comprising;
at least one processor and associated storage configured to perform the operations that include;
update the importance rank of Web units in the graph substantially in real time during visit of Web units in the graph; and
selectively applying corrective measures;
the processor is configured of updating said importance rank also when the Internet is changing, and wherein an algorithm that governs the order of visiting of Web units is not prescribed by the processor update and corrective measures operations.
- the importance ranks are used by an application;
-
28. A system for updating importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the system comprising;
at least one processor and associated storage, the storage storing for each node in the graph at least;
short history indication representative of what happened to the node in terms of importance rank since last update;
long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
the at least one processor being configured to perform the operations that include;
a) receiving for each visited node a visiting node identification and identifications to its respective at least one child node, if any;
b) for each visited node, updating the importance rank of nodes in said by performing the steps of;
(i) in the case that said visited node has at least one child node, distributing at least substantial part of the short history indication of the visited node to the short history indication of the at least one child node;
(ii) recording at least substantial part of the short history indication of the visited node to the long history indication of the visited node and designating that said recording has been accomplished. c) repeating operations (a) and (b) as many times as required;
said operations (a) to (c) are capable of being executed also when said graph is changing,and if said graph is not strongly connected, said at least one processor being configured to selectively applying corrective measures. - View Dependent Claims (29, 30)
- the graph includes links interconnecting the nodes;
-
31. A system for calculating the importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the system comprising;
at least one processor and associated storage, the storage storing for each node in the graph at least;
short history indication representative of what happened to the node in terms of importance rank since last update;
long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
the at least one processor being configured to perform the operations that include;
a. receiving selected nodes;
b. for the selected node, computing the importance rank as a function of at least one of said short history indication and long history indication. - View Dependent Claims (32, 33, 34, 35)
- the graph includes links interconnecting the nodes;
-
36. A storage medium storing a computer implemented code for performing method steps for updating importance rank of nodes in a dynamically changing large graph;
- the importance ranks are used by an application;
the graph includes links interconnecting the nodes;
the method steps include;
a) updating the importance rank of nodes in the graph substantially in real time during visit of nodes in the graph;
if said graph is not strongly connected, selectively applying corrective measures;
an order of visit of nodes is prescribed by an algorithm;
b) repeating step (a) as many times as required;
said updating of importance rank of step (a) is capable of being executed also when the graph is changing,and wherein an algorithm that governs the order of visit of nodes is not prescribed by said updating and applying correction steps.
- the importance ranks are used by an application;
-
37. A storage medium storing a computer implemented code for performing method steps for updating importance rank of Internet Web units in an Internet;
- the importance ranks are used by an application;
the Internet includes Hyper-links interconnecting the Web units;
the method includes the steps of;
a) updating the importance rank of Web units in the internet substantially in real time during visit of the Web units; and
applying corrective measures;
an order of visit of nodes is prescribed by an algorithm;
b) repeating step (a) as many times as required, said updating of importance rank of step (a) is capable of being executed also when the internet is changing, and wherein an algorithm that governs the order of visit of nodes is not prescribed by said by said updating and applying correction steps.
- the importance ranks are used by an application;
-
38. A storage medium storing a computer implemented code for performing method steps for updating importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the method include the steps of;
a) storing for each node in the graph at least;
(i) short history indication representative of what happened to the node in terms of importance rank since last update;
(ii) long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
b) visiting nodes in the graph;
c) for each visited node, updating the importance rank of nodes by performing the steps of;
(i) in the case that said visited node has at least one child node, distributing at least substantial part of the short history indication of the visited node to the short history indication of the at least one child node;
(ii) recording at least substantial part of the short history indication of the visited node to the long history indication of the visited node and designating that said recording has been accomplished. d) repeating steps (b) and (c) as many times as required;
said steps (b) to (d) are capable of being executed also when said graph is changing,and if said graph is not strongly connected, selectively applying corrective measures.
- the graph includes links interconnecting the nodes;
-
39. A storage medium storing a computer implemented code for performing method steps for calculating the importance rank of nodes in a dynamically changing graph, the importance ranks are used by an application;
- the graph includes links interconnecting the nodes;
the method comprising the steps of;
(a) providing for each node in the graph at least;
(i) short history indication representative of what happened to the node in terms of importance rank since last update;
(ii) long history indication representative of what happened to the node in terms of importance rank since a certain point of time in the past;
b) selecting node in tie graph;
c) for selected node, computing the importance rank as a function of at least one of said short history indication and long history indication;
repeating steps (b) and (c) as many times as required.
- the graph includes links interconnecting the nodes;
Specification