{"id":"https://openalex.org/W1594122454","doi":"https://doi.org/10.1109/icde.2004.1320002","title":"Hash-merge join: a non-blocking join algorithm for producing fast and early join results","display_name":"Hash-merge join: a non-blocking join algorithm for producing fast and early join results","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W1594122454","doi":"https://doi.org/10.1109/icde.2004.1320002","mag":"1594122454"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2004.1320002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1320002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","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/A5007454642","display_name":"Mohamed F. Mokbel","orcid":"https://orcid.org/0000-0002-6686-1757"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M.F. Mokbel","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103114808","display_name":"Mian Lu","orcid":"https://orcid.org/0009-0002-4853-8881"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Lu","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000123743","display_name":"Walid G. Aref","orcid":"https://orcid.org/0000-0001-8169-7775"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W.G. Aref","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","Department of Computer Science, Purdue University, West Lafayette IN, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007454642"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":7.4159,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.97287378,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9994999766349792,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9991000294685364,"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.9987000226974487,"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/join","display_name":"Join (topology)","score":0.9083853363990784},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.8957172632217407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7944656014442444},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.7517791390419006},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.7170702815055847},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.596592903137207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5409901738166809},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.4635009169578552},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3968072831630707},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39204972982406616},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35486218333244324},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.20372995734214783},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.1252152919769287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12266489863395691},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.09933927655220032}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.9083853363990784},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.8957172632217407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7944656014442444},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.7517791390419006},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.7170702815055847},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.596592903137207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5409901738166809},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.4635009169578552},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3968072831630707},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39204972982406616},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35486218333244324},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.20372995734214783},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1252152919769287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12266489863395691},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.09933927655220032},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.0},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2004.1320002","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2004.1320002","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 20th International Conference on Data Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W150801922","https://openalex.org/W1578961977","https://openalex.org/W1589482605","https://openalex.org/W1684311429","https://openalex.org/W1858414509","https://openalex.org/W1997020216","https://openalex.org/W2015372451","https://openalex.org/W2020147322","https://openalex.org/W2078528123","https://openalex.org/W2095891890","https://openalex.org/W2097345556","https://openalex.org/W2109149785","https://openalex.org/W2132808937","https://openalex.org/W2148322068","https://openalex.org/W2151663987","https://openalex.org/W2157637666","https://openalex.org/W2158237121","https://openalex.org/W2161578281","https://openalex.org/W2164433331","https://openalex.org/W2169486917","https://openalex.org/W2201552871","https://openalex.org/W2203361072","https://openalex.org/W2296677182","https://openalex.org/W4229903866","https://openalex.org/W4233762723","https://openalex.org/W4251246352","https://openalex.org/W4251617391","https://openalex.org/W4253103473","https://openalex.org/W6635372014","https://openalex.org/W6637492368","https://openalex.org/W6682198890"],"related_works":["https://openalex.org/W2511848805","https://openalex.org/W2055999895","https://openalex.org/W2402616390","https://openalex.org/W2074890970","https://openalex.org/W1594122454","https://openalex.org/W4221156305","https://openalex.org/W2479012040","https://openalex.org/W2095891890","https://openalex.org/W2260656822","https://openalex.org/W1584687013"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,41,45,56,60,76,107,115,132,142],"hash-merge":[3],"join":[4,12,52,61,86,90,104,148],"algorithm":[5,13,31,68,87,117],"(HMJ,":[6],"for":[7,102],"short);":[8],"a":[9,121],"new":[10],"nonblocking":[11,147],"that":[14,88,124,139],"deals":[15],"with":[16,34],"data":[17,95],"items":[18],"from":[19],"remote":[20],"sources":[21,58,109],"via":[22,120],"unpredictable,":[23],"slow,":[24],"or":[25],"bursty":[26],"network":[27],"traffic.":[28],"The":[29,66,72,79,97],"HMJ":[30,67,116,140],"is":[32,100,134],"designed":[33],"two":[35,57,70,108,145],"goals":[36],"in":[37],"mind:":[38],"(1)":[39],"minimize":[40],"time":[42],"to":[43],"produce":[44,51],"first":[46],"few":[47],"results,":[48],"and":[49,75,151],"(2)":[50],"results":[53,91,105,137],"even":[54],"if":[55,106],"of":[59,114,144],"operator":[62],"occasionally":[63],"get":[64],"blocked.":[65,111],"has":[69],"phases:":[71],"hashing":[73,80],"phase":[74,81,99],"merging":[77,98],"phase.":[78],"employs":[82],"an":[83],"in-memory":[84,126],"hash-based":[85],"produces":[89],"as":[92,94],"quickly":[93],"arrives.":[96],"responsible":[101],"producing":[103],"are":[110,118],"Both":[112],"phases":[113],"connected":[119],"flushing":[122],"policy":[123],"flushes":[125],"parts":[127],"into":[128],"disk":[129],"storage":[130],"once":[131],"memory":[133],"exhausted.":[135],"Experimental":[136],"show":[138],"combines":[141],"advantages":[143],"state-of-the-art":[146],"algorithms":[149],"(XJoin":[150],"Progressive":[152],"Merge":[153],"Join)":[154],"while":[155],"avoiding":[156],"their":[157],"shortcomings.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}