Efficiently ranking web pages via matrix index manipulation and improved caching
First Claim
1. A method of ranking objects in a collection of objects, one or more of the objects in the collection having links to other objects in the collection, the method comprising:
- ordering the objects according to their proximity to other objects in the collection with respect to the links; and
storing the links between objects in a memory according to the ordering of the objects.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods and systems are described for computing page rankings more efficiently. Using an interconnectivity matrix describing the interconnection of web pages, a new matrix is computed. The new matrix is used to compute the average of values associated with each web page'"'"'s neighboring web pages. The secondary eigenvector of this new matrix is computed, and indices for web pages are relabeled according to the eigenvector. The data structure storing the interconnectivity information is preferably also physically sorted according to the eigenvector. By reorganizing the matrix used in the web page ranking computations, caching is performed more efficiently, resulting in faster page ranking techniques. Methods for efficiently allocating the distribution of resources are also described.
-
Citations
26 Claims
-
1. A method of ranking objects in a collection of objects, one or more of the objects in the collection having links to other objects in the collection, the method comprising:
-
ordering the objects according to their proximity to other objects in the collection with respect to the links; and
storing the links between objects in a memory according to the ordering of the objects. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A computer-readable medium including computer-executable instructions facilitating the ranking of objects in a collection of objects, one or more of the objects in the collection having links to other objects in the collection, the computer-executable instructions performing the steps of:
-
ordering the objects according to their proximity to other objects in the collection with respect to the links; and
storing the links between objects in a memory according to the ordering of the objects. - View Dependent Claims (8, 9, 10, 11)
-
-
12. A method of ordering objects from a collection of interconnected objects, the interconnection of objects represented by a first matrix, the method comprising:
-
computing a second matrix relative to the first matrix;
approximating a secondary eigenvector of the second matrix; and
ordering the objects relative to the values in the approximation to the secondary eigenvector. - View Dependent Claims (13, 14, 15, 16, 17)
-
-
18. A computer-readable medium including computer-executable instructions facilitating the ordering of objects in a collection of interconnected objects, the interconnection of objects represented by a first matrix, the computer-executable instructions performing the steps of:
-
computing a second matrix relative to the first matrix;
approximating a secondary eigenvector of the second matrix; and
ordering the objects relative to the values in the approximation to the secondary eigenvector. - View Dependent Claims (19, 20, 21, 22, 23)
-
-
24. A computer-readable medium including computer-executable instructions facilitating the ranking of objects in a collection of interconnected objects, a description of the interconnection stored in a memory according to a first ordering of the objects, the computer-executable instructions performing the step of:
re-ordering the objects relative to their proximity to the other objects via the interconnection. - View Dependent Claims (25, 26)
Specification