{"id":"https://openalex.org/W2160276892","doi":"https://doi.org/10.1145/2213836.2213854","title":"Managing large dynamic graphs efficiently","display_name":"Managing large dynamic graphs efficiently","publication_year":2012,"publication_date":"2012-05-20","ids":{"openalex":"https://openalex.org/W2160276892","doi":"https://doi.org/10.1145/2213836.2213854","mag":"2160276892"},"language":"en","primary_location":{"id":"doi:10.1145/2213836.2213854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213836.2213854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101555389","display_name":"Jayanta Mondal","orcid":"https://orcid.org/0000-0003-4263-4995"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jayanta Mondal","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113637223","display_name":"Amol Deshpande","orcid":"https://orcid.org/0000-0003-4650-3925"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amol Deshpande","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.1057,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.98819819,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8911265134811401},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5228571891784668},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4956010580062866},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.47339093685150146},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4629477262496948},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45312029123306274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8911265134811401},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5228571891784668},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4956010580062866},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.47339093685150146},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4629477262496948},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45312029123306274},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2213836.2213854","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213836.2213854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.295.3693","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.3693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~amol/papers/sigmod12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.1014","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.1014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~jayanta/papers/sigmod12.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1489285575","https://openalex.org/W1500512125","https://openalex.org/W1584753249","https://openalex.org/W1797019445","https://openalex.org/W1858550296","https://openalex.org/W1966461475","https://openalex.org/W1990223473","https://openalex.org/W1991361934","https://openalex.org/W2000159446","https://openalex.org/W2008620264","https://openalex.org/W2022015062","https://openalex.org/W2038933817","https://openalex.org/W2041021943","https://openalex.org/W2043655327","https://openalex.org/W2046833425","https://openalex.org/W2048666037","https://openalex.org/W2070232376","https://openalex.org/W2078331965","https://openalex.org/W2099674897","https://openalex.org/W2100586946","https://openalex.org/W2104085672","https://openalex.org/W2104146203","https://openalex.org/W2107483781","https://openalex.org/W2116391761","https://openalex.org/W2117410972","https://openalex.org/W2117766443","https://openalex.org/W2122710250","https://openalex.org/W2123966888","https://openalex.org/W2125032792","https://openalex.org/W2131681506","https://openalex.org/W2131717044","https://openalex.org/W2146591355","https://openalex.org/W2151936673","https://openalex.org/W2167927436","https://openalex.org/W2169624745","https://openalex.org/W2170616854","https://openalex.org/W2171874178","https://openalex.org/W2186028812","https://openalex.org/W2293919922","https://openalex.org/W3005483784","https://openalex.org/W3101507098","https://openalex.org/W3137281031","https://openalex.org/W4240433220","https://openalex.org/W6629256684","https://openalex.org/W6652609139","https://openalex.org/W6679686813","https://openalex.org/W6682324679"],"related_works":["https://openalex.org/W2307385607","https://openalex.org/W2403173187","https://openalex.org/W978295669","https://openalex.org/W2330571702","https://openalex.org/W3115442681","https://openalex.org/W2007838763","https://openalex.org/W2391000461","https://openalex.org/W4386112722","https://openalex.org/W2111479807","https://openalex.org/W2972311463"],"abstract_inverted_index":{"There":[0],"is":[1,62,83,141,295],"an":[2,111],"increasing":[3],"need":[4],"to":[5,80,95,162,186,207,212,216,228,244,297],"ingest,":[6],"manage,":[7],"and":[8,25,46,51,69,126,181,191,214,257,290,303],"query":[9,129],"large":[10,78,98,155,300],"volumes":[11],"of":[12,38,75,100,110,149,157,171,232,276],"graph-structured":[13],"data":[14,115,211],"arising":[15],"in":[16,90,136,153,174],"applications":[17],"like":[18],"social":[19,288],"networks,":[20,22,24],"communication":[21,189],"biological":[23],"so":[26],"on.":[27],"Graph":[28],"databases":[29,68],"that":[30,41,202,264,292,304],"can":[31,42],"explicitly":[32],"reason":[33],"about":[34],"the":[35,39,88,97,108,172,175,188,192,230,261,277,307],"graphical":[36],"nature":[37],"data,":[40],"support":[43],"flexible":[44],"schemas":[45],"node-centric":[47],"or":[48,219],"edge-centric":[49],"analysis":[50,256],"querying,":[52,180],"are":[53],"ideal":[54],"for":[55,177,260],"storing":[56],"such":[57,101],"data.":[58,102],"However,":[59],"although":[60],"there":[61,82],"much":[63],"work":[64,85],"on":[65,70,86,274,286],"single-site":[66],"graph":[67,92,114,139,145,176],"efficiently":[71],"executing":[72],"different":[73],"types":[74],"queries":[76],"over":[77,131],"graphs,":[79],"date":[81],"little":[84],"understanding":[87],"challenges":[89],"distributed":[91,113,138,158],"databases,":[93],"needed":[94],"handle":[96,298],"scale":[99],"In":[103],"this":[104],"paper,":[105],"we":[106,196,223,238],"propose":[107,168,224,239],"design":[109],"in-memory,":[112],"management":[116],"system":[117,285,294],"aimed":[118],"at":[119],"managing":[120],"a":[121,137,144,147,154,198,225,241,272,287],"large-scale":[122],"dynamically":[123,208],"changing":[124],"graph,":[125,289],"supporting":[127,178],"low-latency":[128,179],"processing":[130],"it.":[132],"The":[133],"key":[134],"challenge":[135],"database":[140],"that,":[142],"partitioning":[143],"across":[146,160],"set":[148],"machines":[150],"inherently":[151],"results":[152],"number":[156],"traversals":[159],"partitions":[161],"answer":[163],"even":[164],"simple":[165],"queries.":[166],"We":[167,252,266,282],"aggressive":[169],"replication":[170,200,235,247],"nodes":[173],"investigate":[182],"three":[183],"novel":[184],"techniques":[185],"minimize":[187],"bandwidth":[190,309],"storage":[193],"requirements.":[194],"First,":[195],"develop":[197],"hybrid":[199],"policy":[201],"monitors":[203],"node":[204],"read-write":[205],"frequencies":[206],"decide":[209],"what":[210],"replicate,":[213],"whether":[215],"do":[217],"eager":[218],"lazy":[220],"replication.":[221],"Second,":[222],"clustering-based":[226],"approach":[227],"amortize":[229],"costs":[231],"making":[233],"these":[234],"decisions.":[236],"Finally,":[237],"using":[240],"fairness":[242],"criterion":[243],"dictate":[245],"how":[246],"decisions":[248],"should":[249],"be":[250],"made.":[251],"provide":[253],"both":[254],"theoretical":[255],"efficient":[258],"algorithms":[259],"optimization":[262],"problems":[263],"arise.":[265],"have":[267],"implemented":[268],"our":[269,284,293],"framework":[270],"as":[271],"middleware":[273],"top":[275],"open-source":[278],"CouchDB":[279],"key-value":[280],"store.":[281],"evaluate":[283],"show":[291],"able":[296],"very":[299],"graphs":[301],"efficiently,":[302],"it":[305],"reduces":[306],"network":[308],"consumption":[310],"significantly.":[311]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}