Abstract
The research community has devoted an increased attention to reduce the computation time needed by Web ranking algorithms. Many efforts have been devoted to improve PageRank [4, 23], the well known ranking algorithm used by Google. The core of PageRank exploits an iterative weight assignment of ranks to the Web pages, until a fixed point is reached. This fixed point turns out to be the (dominant) eigenpair of a matrix derived by the Web Graph itself.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the Web: Experiments and algorithms. In: Proc. of the 11th WWW Conf. (2002)
Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. on Internet Technology (to appear, 2004)
Boldi, P., Vigna, S.: WebGraph framework i: Compression techniques. In: Proc. of the 23th Int. WWW Conf. (2004)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117 (1998)
Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the Web. Computer Networks 33, 309–320 (2000)
Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.: On external memory graph traversal. In: SODA, pp. 859–860 (2000)
Chen, Y., Gan, Q., Suel, T.: I/o-efficient techniques for computing Pagerank. In: Proc. of the 11th WWW Conf. (2002)
Cho, J., Roy, S.: Impact of Web search engines on page popularity. In: Proc. of the 13th WWW Conf. (2004)
Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. 24th Nat. Conf. ACM, pp. 157–172 (1969)
Douglas, C., Hu, J., Iskandarani, M., Kowarschik, M., Rüde, U., Weiss, C.: Maximizing cache memory usage for multigrid algorithms. In: Multiphase Flows and Transport in Porous Media: State of the Art, pp. 124–137. Springer, Heidelberg (2000)
Eiron, N., McCurley, S., Tomlin, J.A.: Ranking the web frontier. In: Proc. of 13th WWW Conf. (2004)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)
Haveliwala, T.: Efficient computation of PageRank. Technical report, Stanford University (1999)
Haveliwala, T.: Topic-sensitive PageRank. In: Proc. of the 11th WWW Conf. (2002)
Haveliwala, T., Kamvar, S., Jeh, G.: An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University (2003)
Jeh, G., Widom, J.: Scaling personalized Web search. In: Proc. of the 12th WWW Conf. (2002)
Kamvar, S., Haveliwala, T.: The condition number of the pagerank problem. Technical report, Stanford University (2003)
Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating PageRank computations. In: Proc. of 12th. WWW Conf. (2003)
Kamvar, S.D., Haveliwala, T.H., Manning, C., Golub, G.H.: Exploiting the block structure of the Web for computing PageRank. Technical report, Stanford University (2003)
Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics (to appear, 2004)
Lee, C.P., Golub, G.H., Zenios, S.A.: A fast two-stage algorithm for computing PageRank. Technical report, Stanford University (2003)
Mehlhorn, K., Meyer, U.: External-memory breadthfirst search with sublinear I/O. In: European Symposium on Algorithms, pp. 723–735 (2002)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford (1998)
Stewart, W.S.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1995)
Varga, R.S.: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Del Corso, G.M., Gullí, A., Romani, F. (2004). Fast PageRank Computation Via a Sparse Linear System (Extended Abstract). In: Leonardi, S. (eds) Algorithms and Models for the Web-Graph. WAW 2004. Lecture Notes in Computer Science, vol 3243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30216-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30216-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23427-2
Online ISBN: 978-3-540-30216-2
eBook Packages: Springer Book Archive