Estimating Pagerank on graph streams

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2008, Pages 69-78

  Sarma, Atish Das ^a   Gollapudi, Sreetinvas ^b   Panigrahy, Rina ^b  

^a Georgia Tech

^b MICROSOFT RESEARCH   (United States)

Author keywords

Graph conductance; Mixing time; Pagerank; Random walk; Streaming algorithms

Indexed keywords

GRAPH CONDUCTANCE; MIXING TIME; PAGERANK; RANDOM WALK; STREAMING ALGORITHMS;

PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

DATABASE SYSTEMS;

EID: 57349088162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376928     Document Type: Conference Paper

References (30)

1. N. Alon, Y, Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. Local graph partitioning using pagerank vectors. In Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 475-486, 2006.
3. 4/3 . In ACM Symposium on Theory of Computing, pages 230-239, 1997.
4. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In In Proc. ACM-SIAM Symposium, on Discrete Algorithms, pages 623-632, 2002.
5. T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubenfeld, and P. White. Testing random variables for independence and identity. In Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 442-451, 2001.
6. L. Bhuvanagiri and S. Ganguly. Estimating entropy over data streams. In European Symposium on Algorithms (ESA), pages 148-159, 2006.
7. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In Proc of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 708-713, 2006.
8. Sergey Brin and Lawrence Page, The anatomy of a large-scale hypertextual web search engine. In Proc. 7th international conference on World Wide Web, pages 107-117, 1998.
9. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohle. Counting triangles in data streams. In PODS, pages 253-262, 2006.
10. G. Cormode and S. Muthukrishnan. Space efficient mining of multigraph streams. In In ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS, pages 271-282, 2005.
11. C. Demetrescu, I. Finocchi, and A. Ribichini. Trading of space for passes in graph streaming problems. In In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 714-723, 2006.
12. Uriel Feige. A spectrum of time-space trade-offs for undirected s-t connectivity. Journal of Computer and System Sciences, 54(2):305-316, 1997.
13. J. Feigenbaum, S. Kannan, A McGregor, S Suri, and J. Zhang. Graph distances in the streaming model: the value of space. In In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 745-754, 2005.
14. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, and Zoya Svitkina. On the complexity of processing massive, unordered, distributed data. In CoRR abs/cs/0611108, 2006.
15. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In In ACM International Conference on Management of Data, SIGMOD, pages 58-66, 2001.
16. S. Guha and A. McGregor. Approximate quantiles and the order of the stream. In In ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS, pages 273-279, 2006.
17. Sudipto Guha and Andrew McGregor. Space-efficient sampling. In In AISTATS, pages 169-176, 2007.
18. Sudipto Guha, Andrew McGregor, and Suresh Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 733-742, 2006.
19. Sudipto Guha and Andrew McGrgor. Lower bounds for quantile estimation in random-order and multi-pass streaming. In ICALP, pages 704-715, 2007.
20. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In In External Memory Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 50, pages 107-118, 1999.
21. P. Indyk and D. P. Woodruff. Optimal approximations of the frequency moments of data streams. In IEEE Symposium on Foundations of Computer Science, FOCS, pages 283-292, 2003.
22. Piotr Indyk. Algorithms for dynamic geometric problems over data streams. In ACM Symposium on Theory of Computing, STOC, pages 373-380, 2004.
23. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal of Computing, 18(6):1149-1178, 1989.
24. H. Jowhari and M. Ghodsi. New streaming algorithms for counting triangles in graphs. In In COCOON, pages 710-716, 2005.
25. G.S. Manku, S. Rajagopalan, and B.G. Lindsay. Randomized sampling techniques for space efficient online computation of order statistics of large datasets. In In ACM SIGMOD International Conference on Management of Data, pages 251-262, 1999.
26. A. McGregor. Finding graph matehings in data streams. In In APPROX-RANDOM, pages 170-181, 2005.
27. Frank McSherry. A uniform approach to accelerated pagerank computation. In WWW, pages 575-582, 2005.
28. T. Sarlos, A. Benczur, K. Csalogany, D. Fogaras, and B. Racz. To randomize or not to randomize: Space optimal summaries for hyperlink analysis. In In the 15th International World Wide Web Conference, WWW, pages 297-306, 2006.
29. John Wicks and Amy R. Greenwald. Parallelizing the computation of pagerank. In Proc. 5th Workshop On Algorithms And Models For The Web-Graph (WAW), pages 202-208, 2007.
30. David P. Woodruff. Optimal space lower bounds for all frequency moments'. In In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 167-175, 2004.