{"id":"https://openalex.org/W2053061798","doi":"https://doi.org/10.1109/icde.2013.6544813","title":"Finding connected components in map-reduce in logarithmic rounds","display_name":"Finding connected components in map-reduce in logarithmic rounds","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2053061798","doi":"https://doi.org/10.1109/icde.2013.6544813","mag":"2053061798"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2013.6544813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2013.6544813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","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/A5003599004","display_name":"Vibhor Rastogi","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V. Rastogi","raw_affiliation_strings":["Google, Mountain View, CA, USA","Google, Mountain View, CA USA"],"affiliations":[{"raw_affiliation_string":"Google, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google, Mountain View, CA USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018314576","display_name":"Ashwin Machanavajjhala","orcid":"https://orcid.org/0000-0003-1555-7330"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Machanavajjhala","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, NC, USA","Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Duke Univ., Durham, NC, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055280994","display_name":"Laukik Chitnis","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Chitnis","raw_affiliation_strings":["Google, Mountain View, CA, USA","Google, Mountain View, CA USA"],"affiliations":[{"raw_affiliation_string":"Google, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google, Mountain View, CA USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114259175","display_name":"Anish Das Sarma","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anish Das Sarma","raw_affiliation_strings":["Google, Mountain View, CA, USA","Google, Mountain View, CA USA"],"affiliations":[{"raw_affiliation_string":"Google, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google, Mountain View, CA USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003599004"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":11.89,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.98779687,"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":"50","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9983999729156494,"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.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9939000010490417,"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/hash-function","display_name":"Hash function","score":0.6936739683151245},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5940392017364502},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5828968286514282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5725696682929993},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5345484614372253},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.49697354435920715},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4728696048259735},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.4624932110309601},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45820191502571106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4408568739891052},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41210079193115234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3746510446071625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3503163456916809},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.08931580185890198}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6936739683151245},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5940392017364502},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5828968286514282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5725696682929993},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5345484614372253},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.49697354435920715},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4728696048259735},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.4624932110309601},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45820191502571106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4408568739891052},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41210079193115234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3746510446071625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3503163456916809},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.08931580185890198},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2013.6544813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2013.6544813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W78403084","https://openalex.org/W1814023381","https://openalex.org/W1827980970","https://openalex.org/W1976860187","https://openalex.org/W1979693425","https://openalex.org/W2004350101","https://openalex.org/W2013344760","https://openalex.org/W2019724001","https://openalex.org/W2025220494","https://openalex.org/W2033258621","https://openalex.org/W2039302045","https://openalex.org/W2051586153","https://openalex.org/W2053061798","https://openalex.org/W2125182537","https://openalex.org/W2126399065","https://openalex.org/W2151440203","https://openalex.org/W2166837162","https://openalex.org/W2167927436","https://openalex.org/W2170616854","https://openalex.org/W2173213060","https://openalex.org/W2949418397","https://openalex.org/W4211012425","https://openalex.org/W4213146104","https://openalex.org/W6603233266"],"related_works":["https://openalex.org/W2739612537","https://openalex.org/W2349174696","https://openalex.org/W2360241746","https://openalex.org/W4313041667","https://openalex.org/W1835589799","https://openalex.org/W2144265691","https://openalex.org/W1605991620","https://openalex.org/W4387251676","https://openalex.org/W4385261619","https://openalex.org/W4226052359"],"abstract_inverted_index":{"Given":[0],"a":[1,30,70,77,97,121,177,205],"large":[2,188,250],"graph":[3],"G":[4],"=":[5],"(V,":[6],"E)":[7],"with":[8,186],"millions":[9],"of":[10,37,43,50,57,74,234,242],"nodes":[11,58],"and":[12,40,53,108,116,144,162],"edges,":[13],"how":[14],"do":[15],"we":[16,181],"compute":[17],"its":[18],"connected":[19,189,194],"components":[20,195],"efficiently?":[21],"Recent":[22],"work":[23],"addresses":[24],"this":[25],"problem":[26],"in":[27,59,126,151,171,213,223],"map-reduce,":[28],"where":[29,229],"fundamental":[31],"trade-off":[32],"exists":[33],"between":[34],"the":[35,41,48,51,55,60,217,232,235,240],"number":[36,56,73],"map-reduce":[38,67,91,179,219],"rounds":[39,107,161],"communication":[42,83,113,166],"each":[44],"round.":[45,85],"Denoting":[46],"d":[47,160],"diameter":[49],"graph,":[52],"n":[54,230],"largest":[61,236],"component,":[62],"all":[63,243],"prior":[64],"techniques":[65,192],"for":[66,130,137,193,208,221],"either":[68],"require":[69],"linear,":[71],"\u0398(d),":[72],"rounds,":[75,228],"or":[76],"quadratic,":[78],"\u0398":[79],"(n|V|":[80],"+":[81,111,164],"|E|),":[82],"per":[84,114,167],"We":[86,153,203,238],"propose":[87,204],"here":[88],"two":[89],"efficient":[90],"algorithms:":[92],"(i)":[93],"Hash-Greater-to-Min,":[94],"which":[95,119],"is":[96,120,139,146,216,231],"randomized":[98],"algorithm":[99,207,220],"based":[100],"on":[101,249],"PRAM":[102],"techniques,":[103],"requiring":[104],"O(log":[105,127,226],"n)":[106,128,227],"O(|V":[109],"|":[110],"|E|)":[112,165],"round,":[115,168],"(ii)":[117],"Hash-to-Min,":[118],"novel":[122,206],"algorithm,":[123],"provably":[124],"finishing":[125],"iterations":[129],"path":[131],"graphs.":[132],"The":[133],"proof":[134],"technique":[135],"used":[136],"Hash-to-Min":[138,183],"novel,":[140],"but":[141],"not":[142],"tight,":[143],"it":[145,156],"actually":[147],"faster":[148],"than":[149],"Hash-Greater-to-Min":[150],"practice.":[152],"conjecture":[154],"that":[155],"requires":[157],"2":[158],"log":[159],"3(|V|":[163],"as":[169,201,252,254],"demonstrated":[170],"our":[172,244],"experiments.":[173],"Using":[174],"secondary":[175],"sorting,":[176],"standard":[178],"feature,":[180],"scale":[182],"to":[184,199],"graphs":[185],"very":[187],"components.":[190],"Our":[191],"can":[196],"be":[197],"applied":[198],"clustering":[200,212,222],"well.":[202],"agglomerative":[209],"single":[210],"linkage":[211],"map-reduce.":[214],"This":[215],"first":[218],"at":[224],"most":[225],"size":[233],"cluster.":[237],"show":[239],"effectiveness":[241],"algorithms":[245],"through":[246],"detailed":[247],"experiments":[248],"synthetic":[251],"well":[253],"real-world":[255],"datasets.":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}