- United States Patent: 6,526,440 - http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=/netahtml/search-bool.html&r=1&f=G&l=50&co1=AND&d=ptxt&s1=6,526,440&OS=6,526,440&RS=6,526,440
Ranking search results by reranking the results based on local inter-connectivity. Inventor Krishna Bharat; assignee Google.
- Extrapolation Methods for Accelerating PageRank Computations - http://www.stanford.edu/~sdkamvar/papers/extrapolation.pdf
This paper by Sepandar Kamvar, Taher Haveliwala, Chris Manning, and Gene Golub, published in WWW13, presents an algorithm to speed up the computation of PageRank by making some initial approximations.
- The Second Eigenvalue of the Google Matrix - http://www.stanford.edu/~sdkamvar/papers/secondeigenvalue.pdf
This paper by Sepandar Kamvar and Taher Haveliwala proves analytically the second eigenvalue of the Google Matrix, which has implications for the PageRank algorithm.
- Adaptive Methods for the Computation of PageRank - http://www.stanford.edu/~sdkamvar/papers/adaptive.pdf
This paper by Sepandar Kamvar, Taher Haveliwala, and Gene Golub describes an algorithm to speed up the computation of PageRank using the fact that pages converge at different rates.
- The Google File System - http://www.cs.rochester.edu/sosp2003/papers/p125-ghemawat.pdf
By Ghemawat, Sanjay; Gobioff, Howard; and Leung, Shun-Tak.
- Papers by Googlers - http://labs.google.com/papers.html
Google supplies a partial list of papers written by people now at Google.
- Topic-Sensitive PageRank - http://www2002.org/CDROM/refereed/127/
Taher H. Haveliwala's paper for the 11th International World Wide Web Conference explains that Google proposes to make PageRank reflect importance with respect to a particular topic.
- Computing Iceberg Queries Efficiently - http://www.vldb.org/conf/1998/p299.pdf
By Fang, Min; Shivakumar, Narayanan; Garcia-Molina, Hector; Motwani, Rajeev; Ullman, Jeffrey D. "In this paper we develop efficient execution strategies for an important class of queries that we call iceberg queries. An iceberg query performs an aggregate function over an attribute (or set of attributes) and then eliminates aggregate values that are below some specified threshold."
- WWW2003: Detecting near-replicas on the Web by content and hyperlink analysis - http://www2003.org/cdrom/papers/poster/p193/p193-diiorio-IE/p193-diiorio.html
Paper by Ernesto Di Iorio, et. al. "In this paper we propose a technique for finding lists of similar documents, and in particular replicas and near-replicas, based on a pair of signatures which take into account both the document contents and the hyperlink structure. "
- Efficient Crawling Through URL Ordering - http://www.csd.uch.gr/~hy558/papers/cho-order.pdf
By Cho, Junghoo; Garcia-Molina, Hector; Page, Lawrence. Available in Postscript, PDF, and plain text formats.
|