{"id":"https://openalex.org/W2883178895","doi":"https://doi.org/10.1145/3294052.3319690","title":"Robust Set Reconciliation via Locality Sensitive Hashing","display_name":"Robust Set Reconciliation via Locality Sensitive Hashing","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2883178895","doi":"https://doi.org/10.1145/3294052.3319690","mag":"2883178895"},"language":"en","primary_location":{"id":"doi:10.1145/3294052.3319690","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319690","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319690","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319690","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079834850","display_name":"Thomas Morgan","orcid":"https://orcid.org/0000-0002-4017-3147"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"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":"Tom Morgan","raw_affiliation_strings":["Harvard University & Google, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University & Google, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1291425158","https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062318856"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00308471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"164","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9962000250816345,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9962000250816345,"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.9926000237464905,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.98089998960495,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.697001039981842},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5981978178024292},{"id":"https://openalex.org/keywords/alice-and-bob","display_name":"Alice and Bob","score":0.5794190168380737},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5683823823928833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5540015697479248},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.4988412857055664},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.49822092056274414},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4443912208080292},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4281367361545563},{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.4107052683830261},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4043121933937073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3722754120826721},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3393981456756592},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.2523224949836731}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.697001039981842},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5981978178024292},{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.5794190168380737},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5683823823928833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5540015697479248},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.4988412857055664},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.49822092056274414},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4443912208080292},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4281367361545563},{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.4107052683830261},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4043121933937073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3722754120826721},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3393981456756592},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.2523224949836731},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3294052.3319690","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319690","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319690","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3294052.3319690","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3294052.3319690","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3294052.3319690","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4699999988079071,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G1023616090","display_name":null,"funder_award_id":"CCF-1563710","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2269895880","display_name":null,"funder_award_id":"CNS-1228598, CCF-1320231, CCF-1563710, CCF-1535795","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6050657354","display_name":null,"funder_award_id":"CNS-1228598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6133564518","display_name":null,"funder_award_id":"CCF-1535795","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6289631934","display_name":"AF: Small: Data Synchronization : Theory, Algorithms, and Practice","funder_award_id":"1320231","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6647242665","display_name":"TWC: Medium: Collaborative: Privacy-Preserving Distributed Storage and Computation","funder_award_id":"1228598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8648019094","display_name":"AitF: FULL: Collaborative Research: Better Hashing for Applications:  From Nuts & Bolts to Asymptotics","funder_award_id":"1535795","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2883178895.pdf","grobid_xml":"https://content.openalex.org/works/W2883178895.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1582154559","https://openalex.org/W1593069050","https://openalex.org/W1595409123","https://openalex.org/W1977759320","https://openalex.org/W1991140438","https://openalex.org/W2001085501","https://openalex.org/W2004336221","https://openalex.org/W2012833704","https://openalex.org/W2026325114","https://openalex.org/W2035490465","https://openalex.org/W2037633400","https://openalex.org/W2043020364","https://openalex.org/W2082557718","https://openalex.org/W2084817433","https://openalex.org/W2088263428","https://openalex.org/W2089797683","https://openalex.org/W2093252122","https://openalex.org/W2113142402","https://openalex.org/W2126609747","https://openalex.org/W2133225898","https://openalex.org/W2142423295","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2222512263","https://openalex.org/W2401693723","https://openalex.org/W2949453098","https://openalex.org/W2952154472","https://openalex.org/W2963201219","https://openalex.org/W2964279644","https://openalex.org/W2979473749","https://openalex.org/W4210296975","https://openalex.org/W4240018112"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2413588304","https://openalex.org/W2774705104","https://openalex.org/W4286907761","https://openalex.org/W2916710807","https://openalex.org/W2009411567","https://openalex.org/W2052708136","https://openalex.org/W3160597273"],"abstract_inverted_index":{"We":[0],"consider":[1],"variations":[2],"of":[3,17,34,42,71,99,120,134],"set":[4,16,33,41,56,70],"reconciliation":[5],"problems":[6],"where":[7,115,129],"two":[8],"parties,":[9],"Alice":[10],"and":[11,23,82,141],"Bob,":[12],"each":[13,98],"hold":[14],"a":[15,20,32,45,69,92,179],"points":[18,35,43,72],"in":[19,44,78,83,162,178],"metric":[21],"space,":[22,122],"the":[24,61,85,118,121,132,175],"goal":[25,62,86],"is":[26,37,63,74,87,95,117,131,156],"for":[27,64,88],"Bob":[28,65,89],"to":[29,39,53,66,76,90,97,172],"conclude":[30],"with":[31,68,164,174],"that":[36,73,94],"close":[38,75,96],"Alice's":[40,77],"well-defined":[46],"way.":[47],"This":[48,168],"setting":[49,177],"has":[50,104],"been":[51,105],"referred":[52],"as":[54],"robust":[55],"reconciliation.":[57],"In":[58],"one":[59],"variation,":[60],"end":[67],"earth":[79],"mover's":[80],"distance,":[81],"another":[84],"have":[91],"point":[93],"Alice's.":[100],"The":[101,136],"first":[102],"problem":[103,138],"studied":[106],"before;":[107],"while":[108],"previous":[109],"results":[110],"achieved":[111],"an":[112,125],"$O(d)$":[113],"approximation,":[114,128],"d":[116],"dimension":[119],"we":[123,143],"achieve":[124],"$O(\u0142og":[126],"n)$":[127],"n":[130],"number":[133],"points.":[135],"second":[137],"appears":[139],"new,":[140],"here":[142],"find":[144],"schemes":[145],"that,":[146],"under":[147],"certain":[148],"conditions,":[149],"use":[150],"sublinear":[151],"communication.":[152],"Our":[153],"primary":[154],"novelty":[155],"utilizing":[157],"Invertible":[158],"Bloom":[159],"Lookup":[160],"Tables":[161],"combination":[163,169],"locality":[165],"sensitive":[166],"hashing.":[167],"allows":[170],"us":[171],"cope":[173],"geometric":[176],"communication-efficient":[180],"manner.":[181]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}