Name
Abstract | ||
|---|---|---|
We propose and analyze an efficient scheduling policy for revisiting web pages so as to keep a local repository as up to date as possible. The main contribution of our policy is the fact that it takes into account the politeness constraint in order to compute the revisiting times.Our experiments suggest that the performance of our policy is very. close to the optimal one and that it is significantly better than the one obtained using a reasonable variation of the policy proposed in [Wolf et. al., WWW 2002]. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/LA-WEB.2007.55 | LA-WEB |
Keywords | Field | DocType |
scheduling,web pages | Data mining,Web page,Scheduling (computing),Computer science,Politeness,Communication channel,Processor scheduling,Service-oriented architecture,Web server | Conference |
ISBN | Citations | PageRank |
0-7695-3008-7 | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Críston De Souza | 1 | 29 | 2.13 |
| Eduardo Sany Laber | 2 | 229 | 27.12 |
| Caio Valentim | 3 | 5 | 1.46 |
| Eduardo Cardoso | 4 | 3 | 1.11 |