Name
Title | ||
|---|---|---|
Computing Web Page Importance without Storing the Graph of the Web (extended abstract) |
Abstract | ||
|---|---|---|
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance or page rank is defined as the fixpoint of a matrix equation. Previous algorithms compute it off-line and require the use of a lot of extra CPU as well as disk resources in particular to store and maintain the link matrix of the web. We briefly discuss a new algorithm that works on-line, and uses much less resources. In particular, it does not require storing the link matrix. It is on-line in that it continuously refines its estimate of page importance while the web/graph is visited. When the web changes, page importance changes as well. We modify the algorithm so that it adapts dynamically to changes of the web. We report on experiments on web data and on synthetic data. |
Year | Venue | Keywords |
|---|---|---|
2002 | IEEE Data Eng. Bull. | matrix equation,web pages,synthetic data |
DocType | Volume | Issue |
Journal | 25 | 1 |
Citations | PageRank | References |
4 | 1.10 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Serge Abiteboul | 1 | 9095 | 2941.83 |
| Mihai Preda | 2 | 212 | 19.88 |
| Gregory Cobena | 3 | 585 | 38.41 |