Techniques for graph analytics on big data

Proceedings - 2013 IEEE International Congress on Big Data, BigData 2013

Volumn , Issue , 2013, Pages 255-262

  Nisar, M Usman ^a   Fard, Arash ^a   Miller, John A ^a  

^a University of Georgia   (United States)

Author keywords

big data; graph analytics; graph simulation; parallel and distributed algorithms

Indexed keywords

BIG DATUM; COMMUNICATION BEHAVIOR; GRAPH ANALYTICS; GRAPH PATTERN MATCHING; GRAPH SIMULATION; PARALLEL AND DISTRIBUTED ALGORITHMS; REGULAR-EXPRESSION MATCHING; SUBGRAPH ISOMORPHISM;

PATTERN MATCHING; SEARCH ENGINES;

ALGORITHMS;

EID: 84886043077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.Congress.2013.78     Document Type: Conference Paper

References (31)

1. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. ACM, 2007, pp. 2942.
2. Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li, "Efficient subgraph matching on billion node graphs," Proceedings of the VLDB Endowment, vol. 5, no. 9, pp. 788-799, 2012.
3. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, "Computing simulations on finite and infinite graphs," in Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on. IEEE, 1995, pp. 453-462.
4. A. Fard, U. Nisar, L. Ramaswamy, J. A. Miller, and M. Saltz, "Distributed algorithms for graph pattern matching," http://www.cs.uga.edu/~ar/abstract.pdf, Tech. Rep., 2013.
5. B. Gallagher, "Matching structure and semantics: A survey on graph-based pattern matching," AAAI FS, vol. 6, pp. 45-53, 2006.
6. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990.
7. J. Brynielsson, J. Hogberg, L. Kaati, C. Martenson, and P. Svenson, "Detecting social positions using simulation," in Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conference on. IEEE, 2010, pp. 48-55.
8. A. Fard, A. Abdolrashidi, L. Ramaswamy, and J. A. Miller, "Towards efficient query processing on massive time-evolving graphs," in Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), 2012 8th International Conference on, oct. 2012, pp. 567-574.
9. D. R. Zerbino and E. Birney, "Velvet: algorithms for de novo short read assembly using de bruijn graphs," Genome research, vol. 18, no. 5, pp. 821-829, 2008.
10. S. Ma, Y. Cao, W. Fan, J. Huai, and T. Wo, "Capturing topology in graph pattern matching," Proceedings of the VLDB Endowment, vol. 5, no. 4, pp. 310-321, 2011.
11. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," International journal of pattern recognition and artificial intelligence, vol. 18, no. 03, pp. 265-298, 2004.
12. J. R. Ullmann, "An algorithm for subgraph isomorphism," Journal of the ACM (JACM), vol. 23, no. 1, pp. 31-42, 1976.
13. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, "A (sub) graph isomorphism algorithm for matching large graphs," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 26, no. 10, pp. 1367-1372, 2004.
14. D. Gregor and A. Lumsdaine, "The parallel BGL: A generic library for distributed graph computations," Parallel Object-Oriented Scientific Computing (POOSC), 2005.
15. A. Chan, F. Dehne, and R. Taylor, "Cgmgraph/cgmlib: Implementing and testing CGM graph algorithms on pc clusters and shared memory machines," International Journal ofHigh Performance Computing Applications, vol. 19, no. 1, pp. 8197, 2005.
16. J. Dean and S. Ghemawat, "Mapreduce: simplified data processing on large clusters," Communications ofthe ACM, vol. 51, no. 1, pp. 107-113, 2008.
17. U. Kang, C. E. Tsourakakis, and C. Faloutsos, "Pegasus: A peta-scale graph mining system implementation and observations," in Data Mining, 2009. ICDM'09. Ninth IEEE International Conference on. IEEE, 2009, pp. 229-238.
18. L. G. Valiant, "A bridging model for parallel computation," Communications of the ACM, vol. 33, no. 8, pp. 103-111, 1990.
19. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, "Pregel: a system for large-scale graph processing," in Proceedings ofthe 2010 ACM SIGMOD International Conference on Management ofdata. ACM, 2010, pp. 135-146.
20. S. Salihoglu and J. Widom, "GPS: A graph processing system," Tech. Rep., 2012.
21. P. Stutz, A. Bernstein, and W. Cohen, "Signal/collect: Graph algorithms for the (semantic) web," in The Semantic Web-ISWC 2010. Springer, 2010, pp. 764-780.
22. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein, "Graphlab: A new framework for parallel machine learning," arXiv preprint arXiv:1006.4990, 2010.
23. G. Karypis and V. Kumar, "Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0," Tech. Rep., 1995.
24. "Supplement for: A comparison of techniques for graph analytics on big data," http://www.cs.uga.edu/~nisar/papersupplement.pdf.
25. "Laboratory for Web Algorithmics," http://law.di.unimi.it/ datasets.php.
26. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM Journal on scientific Computing, vol. 20, no. 1, pp. 359-392, 1998.
27. -, "Parallel multilevel series k-way partitioning scheme for irregular graphs," SIAM Review, vol. 41, no. 2, pp. 278300, 1999.
28. B. A. Huberman and L. A. Adamic, "Internet: growth dynamics of the world-wide web," Nature, vol. 401, no. 6749, pp. 131-131, 1999.
29. W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu, "Graph homo-morphism revisited for graph matching," Proceedings ofthe VLDB Endowment, vol. 3, no. 1-2, pp. 1161-1172, 2010.
30. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu, "Graph pattern matching: from intractable to polynomial time," Proceedings ofthe VLDB Endowment, vol. 3, no. 1-2, pp. 264275, 2010.
31. S. Ma, Y. Cao, J. Huai, and T. Wo, "Distributed graph pattern matching," in Proceedings ofthe 21st international conference on World Wide Web. ACM, 2012, pp. 949-958.