Approxrank: Estimating rank for a subgraph

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 54-65

  Wu, Yao ^a   Raschid, Louiqa ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; COMPUTING RANKINGS; CONSTANT FACTORS; EXACT SOLUTION; FOCUSED CRAWLER; LINK STRUCTURE; ORDER OF MAGNITUDE; PAGERANK; PAGERANK SCORE; PERSONALIZED SEARCH; RUNTIME PERFORMANCE; SEMANTIC QUERY; STOCHASTIC COMPLEMENTATION; SUBGRAPH; SUBGRAPHS; TRANSITION MATRICES; WEB GRAPHS;

SEARCH ENGINES;

EID: 67649663912     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.108     Document Type: Conference Paper

References (37)

1. J. V. Davis and I. S. Dhillon, "Estimating the global pagerank of web communities," in KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2006, pp. 116-125.
2. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," in WWW7: Proceedings of the seventh international conference on World Wide Web 7. Amsterdam, The Netherlands, The Netherlands: Elsevier Science Publishers B. V., 1998, pp. 107-117.
3. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," Journal of the ACM, vol. 46, no. 5, pp. 604.632, 1999. [Online]. Available: citeseer.ist.psu.edu/kleinberg99authoritative.html
4. A. Gulli and A. Signorini, "The indexable web is more than 11.5 billion pages," in WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web. New York, NY, USA: ACM Press, 2005, pp. 902-903.
5. http://www.useit.com/alertbox/web-growth.html.
6. S. Chakrabarti, M. van den Berg, and B. Dom, "Focused crawling: a new approach to topic-specific web resource discovery," in WWW '99: Proceeding of the eighth international conference on World Wide Web. New York, NY, USA: Elsevier North-Holland, Inc., 1999, pp. 1623-1640.
7. M. Diligenti, F. Coetzee, S. Lawrence, C. L. Giles, and M. Gori, "Focused crawling using context graphs," in VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2000, pp. 527-534.
8. A. Balmin, V. Hristidis, and Y. Papakonstantinou, "ObjectRank: Authority-based keyword search in databases," in VLDB, 2004. [Online]. Available: citeseer.ist.psu.edu/balmin04objectrank.html
9. R. Varadarajan, V. Hristidis, and L. Raschid, "Explaining and reformulating authority flow queries," in Proceedings of the IEEE International Conference on Data Engineering, 2008.
10. R. Varadarajan, V. Hristidis, L. Raschid, M. Vidal, H. Rodriguez, and L. Ibanez, "Flexible and efficient querying and ranking on hyperlinked data sources," University of Maryland CLIP Lab Technical Report, Tech. Rep., 2008.
11. A. Gulli and A. Signorini, "Building an open source meta-search engine," in WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web. New York, NY, USA: ACM Press, 2005, pp. 1004-1005.
12. T. Suel, C. Mathur, J.-W. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, and K. Shanmugasundaram, "Odissea: A peer-to-peer architecture for scalable web search and information retrieval." in WebDB, 2003, pp. 67.72.
13. D. Zeinalipour-Yazti, V. Kalogeraki, and D. Gunopulos, "Information retrieval techniques for peer-to-peer networks," Computing in Science and Engg., vol. 6, no. 4, pp. 20.26, 2004.
14. N. Eiron, K. S. McCurley, and J. A. Tomlin, "Ranking the web frontier," in WWW '04: Proceedings of the 13th international conference on World Wide Web. New York, NY, USA: ACM Press, 2004, pp. 309-318.
15. A. N. Langville and C. D. Meyer, "Updating markov chains with an eye on google's pagerank," SIAM J. Matrix Anal. Appl., vol. 27, no. 4, pp. 968-987, 2006.
16. J. X. Parreira, D. Donato, S. Michel, and G. Weikum, "Efficient and decentralized pagerank approximation in a peer-to-peer web search network," in VLDB'2006: Proceedings of the 32nd international conference on Very large data bases. VLDB Endowment, 2006, pp. 415-426.
17. Y.-Y. Chen, Q. Gan, and T. Suel, "Local methods for estimating pagerank values," in CIKM '04: Proceedings of the thirteenth ACM international conference on Information and knowledge management. New York, NY, USA: ACM Press, 2004, pp. 381.389.
18. Y. Wang and D. J. DeWitt, "Computing pagerank in a distributed internet search system." in VLDB, 2004, pp. 420.431.
19. P. Berkhin, "A survey on pagerank computing," Internet Mathematics, vol. 2, no. 1, pp. 73.120, 2005.
20. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas, "Link analysis ranking: algorithms, theory, and experiments," ACM Trans. Inter. Tech., vol. 5, no. 1, pp. 231.297, 2005.
21. A. N. Langville and C. D. Meyer, Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, July 2006.
22. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub, "Extrapolation methods for accelerating pagerank computations." in WWW, 2003, pp. 261.270.
23. R. Motwani and P. Raghavan, Randomized algorithms. New York, NY, USA: Cambridge University Press, 1995.
24. A. Z. Broder, R. Lempel, F. Maghoul, and J. Pedersen, "Efficient pagerank approximation via graph aggregation," in WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters. New York, NY, USA: ACM Press, 2004, pp. 484-485.
25. G. M. D. Corso, A. Gullí, and F. Romani, "Fast pagerank computation via a sparse linear system," Journal of Internet Mathematics, vol. 2, no. 3, pp. 251.273, 2005.
26. S. Kamvar, T. Haveliwala, and G. Golub, "Adaptive methods for the computation of pagerank," Stanford University, Tech. Rep., 2003. [Online]. Available: citeseer.ist.psu.edu/kamvar03adaptive.html
27. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub, "Exploiting the block structure of the web for computing pagerank," Stanford Digital Library Technologies Project, Tech. Rep., 2003. [Online]. Available: citeseer.ist.psu.edu/kamvar03exploiting.html
28. K. Aberer and J. Wu, "A framework for decentralized ranking in web information retrieval." in APWeb, 2003, pp. 213.226.
29. G.-R. Xue, H.-J. Zeng, Z. Chen, W.-Y. Ma, H.-J. Zhang, and C.-J. Lu, "Implicit link analysis for small web search," in SIGIR '03: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval. New York, NY, USA: ACM Press, 2003, pp. 56-63.
30. W. J. Stewart, Introduction to the Numerical Solution of Markov Chains. Princeton, NJ, USA: Princeton University Press, 1994.
31. D. Hooley, "Collapsed matrices with (almost) the same eigenstuff," vol. 31, no. 4, 2000, pp. 297-299.
32. A. Y. Ng, A. X. Zheng, and M. I. Jordan, .Link analysis, eigenvectors and stability," in IJCAI, 2001, pp. 903-910.
33. S. Chien, C. Dwork, R. Kumar, D. R. Simon, and D. Sivakumar, "Link evolution: Analysis and algorithms," Internet Mathematics, vol. 1, no. 3, 2003.
34. Z. Nie, Y. Zhang, J.-R. Wen, and W.-Y. Ma, "Object-level ranking: bringing order to web objects," in WWW '05: Proceedings of the 14th international conference on World Wide Web. New York, NY, USA: ACM, 2005, pp. 567-574.
35. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, "Rank aggregation methods for the web," in WWW '01: Proceedings of the 10th international conference on World Wide Web. New York, NY, USA: ACM Press, 2001, pp. 613.622.
36. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee, "Comparing and aggregating rankings with ties," in PODS '04: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. New York, NY, USA: ACM Press, 2004, pp. 47.58.
37. http://www.dmoz.org/.