{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:03:52Z","timestamp":1775815432742,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,20]]},"DOI":"10.1145\/2213836.2213854","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":85,"title":["Managing large dynamic graphs efficiently"],"prefix":"10.1145","author":[{"given":"Jayanta","family":"Mondal","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amol","family":"Deshpande","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/168466.168527"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.200327197"},{"key":"e_1_3_2_1_3_1","volume-title":"Science","author":"Barabasi A.","year":"1999","unstructured":"A. Barabasi and R. Albert . Emergence of scaling in random networks . Science , 1999 . A. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644900"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_6_1","author":"Blondel V. D.","year":"2008","unstructured":"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 . 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.","journal-title":"Journal of Statistical Mechanics-theory and Experiment"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2010.80"},{"key":"e_1_3_2_1_8_1","author":"Capocci A.","year":"2006","unstructured":"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 . 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.","journal-title":"Phys. Rev. E"},{"key":"e_1_3_2_1_9_1","volume-title":"Patoh: Partitioning tool for hypergraphs","author":"Catalyurek U. V.","year":"1999","unstructured":"U. V. Catalyurek and C. Aykanat . Patoh: Partitioning tool for hypergraphs . Bilkent University , Tech . Rep, 1999 . U. V. Catalyurek and C. Aykanat. Patoh: Partitioning tool for hypergraphs. Bilkent University, Tech. Rep, 1999."},{"key":"e_1_3_2_1_10_1","volume-title":"http:\/\/www.graphbase.net\/","author":"Pty Ltd FactNexus","year":"2011","unstructured":"FactNexus Pty Ltd . Graphbase. http:\/\/www.graphbase.net\/ , 2011 . FactNexus Pty Ltd. Graphbase. http:\/\/www.graphbase.net\/, 2011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_3_2_1_12_1","author":"Georgakopoulos G. F.","year":"2007","unstructured":"G. F. Georgakopoulos and K. Politopoulos . Max-density revisited: a generalization and a more efficient algorithm. The Computer Journal , 2007 . G. F. Georgakopoulos and K. Politopoulos. Max-density revisited: a generalization and a more efficient algorithm. The Computer Journal, 2007.","journal-title":"The Computer Journal"},{"key":"e_1_3_2_1_13_1","volume-title":"Rhythms of social interaction: messaging within a massive online network. CoRR, abs\/cs\/0611137","author":"Golder S. A.","year":"2006","unstructured":"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 . 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."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"e_1_3_2_1_15_1","volume-title":"Where are my followers? understanding the locality effect in twitter. CoRR, abs\/1105.3682","author":"Gonzalez R.","year":"2011","unstructured":"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 . 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."},{"key":"e_1_3_2_1_16_1","volume-title":"VLDB","author":"Guting R.","year":"1994","unstructured":"R. Guting . GraphDB : Modeling and querying graphs in databases . In VLDB , 1994 . R. Guting. GraphDB: Modeling and querying graphs in databases. In VLDB, 1994."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298593"},{"key":"e_1_3_2_1_18_1","unstructured":"J. Hamilton. Scaling linkedin. http:\/\/perspectives.mvdirona.com\/2008\/06\/08\/ScalingLinkedIn.aspx 2008.  J. Hamilton. Scaling linkedin. http:\/\/perspectives.mvdirona.com\/2008\/06\/08\/ScalingLinkedIn.aspx 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"e_1_3_2_1_21_1","volume-title":"Why are facebook, digg, and twitter so hard to scale? http:\/\/highscalability.com\/blog\/2009\/10\/13\/why-are-facebook-digg-and-twitter-so-hard-to-scale.html","author":"Blog High Scalability","year":"2009","unstructured":"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-twitter-so-hard-to-scale.html , 2009 . 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-twitter-so-hard-to-scale.html, 2009."},{"key":"e_1_3_2_1_22_1","unstructured":"High Scalibility Blog. Friendster lost lead because of a failure to scale. http:\/\/highscalability.com\/blog\/ 2007\/11\/13\/friendster-lost-lead-because-of-a-failure-to-scale.html 2007.  High Scalibility Blog. Friendster lost lead because of a failure to scale. http:\/\/highscalability.com\/blog\/ 2007\/11\/13\/friendster-lost-lead-because-of-a-failure-to-scale.html 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402747"},{"key":"e_1_3_2_1_24_1","volume-title":"http:\/\/www.infinitegraph.com\/","year":"2011","unstructured":"InfiniteGraph. http:\/\/www.infinitegraph.com\/ , 2011 . InfiniteGraph. http:\/\/www.infinitegraph.com\/, 2011."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"e_1_3_2_1_26_1","volume-title":"VLDB","author":"Kacholia V.","year":"2005","unstructured":"V. Kacholia , S. Pandit , S. Chakrabarti , S. Sudarshan , R. Desai , and H. Karambelkar . Bidirectional expansion for keyword search on graph databases . In VLDB , 2005 . V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005."},{"key":"e_1_3_2_1_27_1","volume-title":"VLDB","author":"Kadambi S.","year":"2011","unstructured":"S. Kadambi , J. Chen , B. Cooper , D. Lomax , R. Ramakrishnan , A. Silberstein , E. Tam , and H. G. Molina . Where in the world is my data ? In VLDB , 2011 . S. Kadambi, J. Chen, B. Cooper, D. Lomax, R. Ramakrishnan, A. Silberstein, E. Tam, and H. G. Molina. Where in the world is my data? In VLDB, 2011."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_31_1","volume-title":"A general purpose distributed data store","author":"Software Kobrix","year":"2011","unstructured":"Kobrix Software . A general purpose distributed data store , 2011 . http:\/\/www.kobrix.com\/hgdb.jsp. Kobrix Software. A general purpose distributed data store, 2011. http:\/\/www.kobrix.com\/hgdb.jsp."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_34_1","author":"Leskovec J.","year":"2009","unstructured":"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 . 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.","journal-title":"Journal of Internet Mathematics"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582723"},{"key":"e_1_3_2_1_36_1","volume-title":"http:\/\/research.microsoft.com\/en-us\/projects\/trinity\/","author":"Research Microsoft","year":"2011","unstructured":"Microsoft Research . Trinity. http:\/\/research.microsoft.com\/en-us\/projects\/trinity\/ , 2011 . Microsoft Research. Trinity. http:\/\/research.microsoft.com\/en-us\/projects\/trinity\/, 2011."},{"key":"e_1_3_2_1_37_1","unstructured":"Neo4j. Neo4j open source nosql graph database. http:\/\/neo4j.org\/ 2011.  Neo4j. Neo4j open source nosql graph database. http:\/\/neo4j.org\/ 2011."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.036122"},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. of The Natl","author":"Newman M.","year":"2006","unstructured":"M. Newman . Modularity and community structure in networks . In Proc. of The Natl . Academy of Sciences , 2006 . M. Newman. Modularity and community structure in networks. In Proc. of The Natl. Academy of Sciences, 2006."},{"key":"e_1_3_2_1_40_1","volume-title":"Divide and conquer: Partitioning online social networks. CoRR, abs\/0905.4918","author":"Pujol J. M.","year":"2009","unstructured":"J. M. Pujol , V. Erramilli , and P. Rodriguez . Divide and conquer: Partitioning online social networks. CoRR, abs\/0905.4918 , 2009 . J. M. Pujol, V. Erramilli, and P. Rodriguez. Divide and conquer: Partitioning online social networks. CoRR, abs\/0905.4918, 2009."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851227"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/932300"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807257"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.119"},{"key":"e_1_3_2_1_45_1","unstructured":"FlockDB. https:\/\/github.com\/twitter\/flockdb.  FlockDB. https:\/\/github.com\/twitter\/flockdb."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/249978.249982"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/103140.103146"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920879"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213836.2213854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:00Z","timestamp":1750238460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":48,"alternative-id":["10.1145\/2213836.2213854","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213854","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}