Managing large dynamic graphs efficiently

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2012, Pages 145-156

  Mondal, Jayanta ^a   Deshpande, Amol ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

feed delivery; graph databases; replication; social networks

Indexed keywords

BIOLOGICAL NETWORKS; COMMUNICATION BANDWIDTH; DYNAMIC GRAPH; FAIRNESS CRITERIA; FEED DELIVERY; GRAPH DATA; GRAPH DATABASE; LARGE GRAPHS; LAZY REPLICATION; LOW-LATENCY; NETWORK BANDWIDTH; NOVEL TECHNIQUES; OPEN-SOURCE; OPTIMIZATION PROBLEMS; REPLICATION; SCHEMAS; SOCIAL GRAPHS; SOCIAL NETWORKS; STORAGE REQUIREMENTS;

ALGORITHMS; INFORMATION MANAGEMENT; MIDDLEWARE; QUERY LANGUAGES; QUERY PROCESSING; SOCIAL NETWORKING (ONLINE); TELECOMMUNICATION SYSTEMS;

GRAPH THEORY;

EID: 84862655967     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213836.2213854     Document Type: Conference Paper

References (48)

1. B. Amann and M. Scholl. Gram: a graph data model and query languages. In ACM Hypertext, 1992.
2. L. A. N. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley. Classes of small-world networks. Proceedings of The National Academy of Sciences, 2000.
3. A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 1999.
4. F. Benevenuto, T. Rodrigues, M. Cha, and V. A. F. Almeida. Characterizing user behavior in online social networks. In Internet Measurement Conference, 2009.
5. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In ICDE, 2002.
6. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics-theory and Experiment, 2008.
7. M. Brocheler, A. Pugliese, and V. S. Subrahmanian. COSI: Cloud oriented subgraph identification in massive social networks. In ASONAM, 2010.
8. A. Capocci, V. D. P. Servedio, F. Colaiori, L. S. Buriol, D. Donato, S. Leonardi, and G. Caldarelli. Preferential attachment in the growth of social networks: The internet encyclopedia wikipedia. Phys. Rev. E, 2006.
9. U. V. Catalyurek and C. Aykanat. Patoh: Partitioning tool for hypergraphs. Bilkent University, Tech. Rep, 1999.
10. FactNexus Pty Ltd. Graphbase. http://www.graphbase.net/, 2011.
11. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: from intractable to polynomial time. In VLDB, 2010.
12. G. F. Georgakopoulos and K. Politopoulos. Max-density revisited: a generalization and a more efficient algorithm. The Computer Journal, 2007.
13. S. A. Golder, D. M. Wilkinson, and B. A. Huberman. Rhythms of social interaction: messaging within a massive online network. CoRR, abs/cs/0611137, 2006.
14. K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword proximity search in complex data graphs. In SIGMOD, 2008.
15. R. Gonzalez, R. C. Rumin, A. Cuevas, and C. Guerrero. Where are my followers? understanding the locality effect in twitter. CoRR, abs/1105.3682, 2011.
16. R. Guting. GraphDB: Modeling and querying graphs in databases. In VLDB, 1994.
17. M. Gyssens, J. Paredaens, and D. van Gucht. A graph-oriented object database model. In PODS, 1990.
18. J. Hamilton. Scaling linkedin. http://perspectives.mvdirona.com/2008/06/ 08/ScalingLinkedIn.aspx, 2008.
19. H. He and A. K. Singh. Graphs-at-a-time: query language and access methods for graph databases. In SIGMOD, 2008.
20. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing, 1995.
21. High Scalability Blog. Why are facebook, digg, and twitter so hard to scale? http://highscalability.com/blog/2009/10/13/why-are-facebook-digg-and- twitterso-hard-to-scale.html, 2009.
22. High Scalibility Blog. Friendster lost lead because of a failure to scale. http://highscalability.com/blog/2007/11/13/friendster-lost-lead-because- of-afailure-to-scale.html, 2007.
23. J. Huang, D. Abadi, and K. Ren. Scalable SPARQL querying of large RDF graphs. In VLDB, 2011.
24. InfiniteGraph. http://www.infinitegraph.com/, 2011.
25. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD, 2008.
26. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005.
27. S. Kadambi, J. Chen, B. Cooper, D. Lomax, R. Ramakrishnan, A. Silberstein, E. Tam, and H. G. Molina. Where in the world ismy data? In VLDB, 2011.
28. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system. In ICDM, 2009.
29. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. In SIAM, 1999.
30. S. Khuller and B. Saha. On finding dense subgraphs. In ICALP, 2009.
31. Kobrix Software. A general purpose distributed data store, 2011. http://www.kobrix.com/hgdb.jsp.
32. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In KDD, 2006.
33. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, 2008.
34. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Journal of Internet Mathematics, 2009.
35. 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 PODC, 2009.
36. Microsoft Research. Trinity. http://research.microsoft.com/en-us/ projects/trinity/, 2011.
37. Neo4j. Neo4j open source nosql graph database. http://neo4j.org/, 2011.
38. M. Newman. Why social networks are different from other types of networks. Physical Review E, 2003.
39. M. Newman. Modularity and community structure in networks. In Proc. of The Natl. Academy of Sciences, 2006.
40. J. M. Pujol, V. Erramilli, and P. Rodriguez. Divide and conquer: Partitioning online social networks. CoRR, abs/0905.4918, 2009.
41. J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez. The little engine(s) that could: scaling online social networks. In SIGCOMM, 2010.
42. L. Sheng and Z. Ozsoyoglu. A graph query language and its query processing. In ICDE, 1999.
43. A. Silberstein, J. Terrace, B. F. Cooper, and R. Ramakrishnan. Feeding Frenzy: Selectively materializing users' event feeds. In SIGMOD, 2010.
44. T. Tran, H. Wang, S. Rudolph, and P. Cimiano. Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In ICDE, 2009.
45. FlockDB. https://github.com/twitter/flockdb.
46. O. Wolfson, S. Jajodia, and Y. Huang. An adaptive data replication algorithm. In TODS, 1997.
47. O. Wolfson and A. Milo. The multicast policy and its relationship to replicated data placement. In TODS, 1991.
48. H. Yildirim, V. Chaoji, and M. J. Zaki. GRAIL: Scalable reachability index for large graphs. In VLDB, 2010.