Counting triangles in data streams

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

Volumn , Issue , 2006, Pages 253-262

  Buriol, Luciana S ^a   Frahling, Gereon ^b   Leonardi, Stefano ^c   Marchetti Spaccamela, Alberto ^c   Sohler, Christian ^b  

^a FEDERAL UNIVERSITY OF SANTA MARIA   (Brazil)

^b UNIVERSITY OF PADERBORN   (Germany)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Graph algorithms; Network analysis; Streaming algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER GRAPHICS; DATA STRUCTURES; ELECTRIC NETWORK ANALYSIS; LARGE SCALE SYSTEMS; SAMPLING; USER INTERFACES;

GRAPH ALGORITHMS; SPACE COMPLEXITY; SPACE REQUIREMENT; STREAMING ALGORITHMS;

DATABASE SYSTEMS;

EID: 34250643647     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142388     Document Type: Conference Paper

References (21)

1. Noga Alon, Yossi Matias, and Mario Szegedy, The space complexity of approximating the frequency moments., J. Compnt. Syst. Sci. 58 (1999), no. 1, 137-147.
2. L. Buriol, G. Frahling, S. Leonardi, A. Marchetti-Spaccamela, and C. Sohler, Counting graph minors in data streams, 2005, DELIS technical report, http://delis.upb.de/paper/DELIS-TR-0245.pdf.
3. Don Coppersmith and Shmuel Winograd, Matrix multiplication via arithmetic progressions., J. Symb. Comput. 9 (1990), no. 3, 251-280.
4. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin Strauss, Surfing wavelets on streams: One-pass summaries for approximate aggregate queries., Proc. of the 27th VLDB, 2001, pp. 79-88.
5. Sudipto Guha, Nick Koudas, and Kyuseok Shim, Data-streams and histograms, ACM Symposium on Theory of Computing, 2001, pp. 471-475.
6. Frank Harary and Helene J. Kommel, Matrix measures for transitivity and balance, Journal of Mathematical Sociology 6 (1979), 199-210.
7. M. Henzinger, P. Raghavan, and S. Rajagopalan, Computing on data streams, 1998, Technote 1998-011, Digital Systems Research Center, Palo Alto, CA.
8. Hossein Jowhari and Mohammad Ghodsi, New streaming algorithms for counting triangles in graphs., Proc. of the 11th COCOON, 2005, pp. 710-716.
9. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, and Eli Upfal, Random graph models for the web graph., Proc. of the 41st FOCS, 2000, pp. 57-65.
10. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins, Trawling the web for emerging cyber-communities., Computer Networks 31 (1999), no. 11-16, 1481-1493.
11. S. Leonardi S. Millozzi L.S. Buriol, D. Donato, Link and temporal analysis of wikigraphs, Technical Report (2005).
12. S. Muthukrishnan, Computing on data streams, 2005, athos.rutgers.edu/muthu/stream-1-1.ps.
13. Anna Ostlin and Rasmus Pagh, Uniform hashing in constant time and linear space, STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (New York, NY, USA), ACM Press, 2003, pp. 622-628.
14. Shalev Itzkovitz Nadav Kashtan Dmitri Chklovskii Ron Milo, Shai Shen-Orr and Uri Alon, Network motifs: Simple building blocks of com- plex networks, Science 298 (2002), no. 509, 824-827.
15. Thomas Schank and Dorothea Wagner, Finding, counting and listing all triangles in large graphs, an experimental study., WEA, 2005, pp. 606-609.
16. Dennis Shasha, Jason Tsong-Li Wang, and Rosalba Giugno, Algorithmics and applications of tree and graph searching., Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002, pp. 39-52.
17. Jeffrey S. Vitter, Random sampling with a reservoir, ACM Trans. Math. Softw. 11 (1985), no. 1, 37-57.
18. Duncan J. Watts and Steven H. Strogatz, Collective dynamics of small- world networks, Nature 393 (1998), 440-442.
19. Xifeng Yan, Philip S. Yu, and Jiawei Han, Graph indexing: A frequent structure-based approach., SIGMOD Conference, 2004, pp. 335-346.
20. D. Sivakumar Z. Bar-Yosseff, R. Kumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), 623-632.
21. J. Zhao, An implementation of min-wise independent permutation family, (2005), http://www.icsi.berkeley.edu/ zhao/minwise/.