Adaptive on-line page importance computation

Proceedings of the 12th International Conference on World Wide Web, WWW 2003

Volumn , Issue , 2003, Pages 280-290

  Abiteboul, Serge ^a,c   Preda, Mihai ^b   Cobena, Gregory ^a,c  

^a INRIA ROCQUENCOURT   (France)

^b Xyleme SA   (France)

^c Xyleme ^*  (France)

Author keywords

hyperlink; page importance; web graph

Indexed keywords

ADAPTIVENESS; DYNAMIC GRAPH; HYPERLINKS; MATRIX EQUATIONS; PAGE IMPORTANCES; SCHEDULING STRATEGIES; SYNTHETIC DATA; WEB GRAPHS;

EXPERIMENTS; HYPERTEXT SYSTEMS; SCHEDULING ALGORITHMS; WORLD WIDE WEB;

MATRIX ALGEBRA;

EID: 84880480000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775152.775192     Document Type: Conference Paper

References (28)

1. S. Abiteboul, G. Cobena, J. Masanes, and G. Sedrati. A first experience in archiving the french web. ECDL, 2002.
2. S. Abiteboul, M. Preda, and G. Cobena. Computing web page importance without storing the graph of the web (extended abstract). IEEE-CS Data Engineering Bulletin, Volume 25, 2002.
3. Alta vista. http://www.altavista.com/.
4. K. Bharat and A. Broder. Estimating the relative size and overlap of public web search engines. 7th International World Wide Web Conference (WWW7), 1998.
5. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. WWW7 Conference, Computer Networks 30(1-7), 1998.
6. Andrei Z. Broder and al. Graph structure in the web. WWW9/Computer Networks, 2000.
7. S. Chakrabarti, M. van den Berg, and B. Dom. Focused crawling: a new approach to topic-specific web resource discovery. 8th World Wide Web Conference, 1999.
8. Steve Chien, Cynthia Dwork, Ravi Kumar, Dan Simon, and D. Sivakumar. Link evolution: Analysis and algorithms. In Workshop on Algorithms and Models for the Web Graph (WAW), 2002.
9. Junghoo Cho, Hector García-Molina, and Lawrence Page. Efficient crawling through URL ordering. Computer Networks and ISDN Systems, 30(1-7):161-172, 1998.
10. Kai Lai Chung. Markov chains with stationary transition probabilities. Springer, 1967.
11. Colin Cooper and Alan M. Frieze. A general model of undirected web graphs. In European Symposium on Algorithms, pages 500-511, 2001.
12. Y. Dong D. Zhang. An efficient algorithm to rank web resources. 9th International World Wide Web Conference, 2000.
13. J. Dean and M.R. Henzinger. Finding related pages in the world wide web. 8th International World Wide Web Conference, 1999.
14. F. R. Gantmacher. Applications of the theory of matrices. In Interscience Publishers, pages 64-79, 1959.
15. Google. http://www.google.com/.
16. T. Haveliwala. Efficient computation of pagerank. Technical report, Stanford University, 1999.
17. H. Garcia-Molina J. Cho. Synchronizing a database to improve freshness. SIGMOD, 2000.
18. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
19. G.V. Meghabghab. Google's web page ranking applied to different topological web graph structures. JASIS 52(9), 2001.
20. Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. ACM Computing Surveys, 28(1):33-37, 1996.
21. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web, 1998.
22. M. Preda. Data acquisition for an xml warehouse. DEA thesis Paris 7 University, 2000.
23. L. Giles S. Lawrence. Accessibility and distribution of information on the web. Nature, 1999.
24. Search-engine watch. www.searchenginewatch.com/.
25. S. Toledo. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development, 41(6), 1997.
26. C.J. van Rijsbergen. Information retrieval. London, Butterworths, 1979.
27. Lucie Xyleme. A dynamic warehouse for xml data of the web. IEEE Data Engineering Bulletin, 2001.
28. Xyleme. www.xyleme.com.