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.