{"id":"https://openalex.org/W2074474336","doi":"https://doi.org/10.1142/s0129626403001306","title":"PIPELINING A SKEW-INSENSITIVE PARALLEL JOIN ALGORITHM","display_name":"PIPELINING A SKEW-INSENSITIVE PARALLEL JOIN ALGORITHM","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2074474336","doi":"https://doi.org/10.1142/s0129626403001306","mag":"2074474336"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626403001306","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626403001306","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5084713903","display_name":"Mostafa Bamha","orcid":"https://orcid.org/0000-0003-1235-4167"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. BAMHA","raw_affiliation_strings":["LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067 Orl\u00e9ans cedex 2, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067 Orl\u00e9ans cedex 2, France","institution_ids":["https://openalex.org/I12449238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052645925","display_name":"Matthieu Exbrayat","orcid":"https://orcid.org/0000-0002-1740-4752"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. EXBRAYAT","raw_affiliation_strings":["LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067 Orl\u00e9ans cedex 2, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067 Orl\u00e9ans cedex 2, France","institution_ids":["https://openalex.org/I12449238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12449238"],"apc_list":null,"apc_paid":null,"fwci":1.7646,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85653085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"03","first_page":"317","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11181","display_name":"Advanced Data Storage Technologies","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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9994000196456909,"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.8536447882652283},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.8309508562088013},{"id":"https://openalex.org/keywords/skew","display_name":"Skew","score":0.6798640489578247},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.5997577905654907},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5708365440368652},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5524762868881226},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4985501766204834},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46860918402671814},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.40266138315200806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32786035537719727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0960192084312439}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8536447882652283},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.8309508562088013},{"id":"https://openalex.org/C43711488","wikidata":"https://www.wikidata.org/wiki/Q7534783","display_name":"Skew","level":2,"score":0.6798640489578247},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.5997577905654907},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5708365440368652},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5524762868881226},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4985501766204834},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46860918402671814},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.40266138315200806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32786035537719727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0960192084312439},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626403001306","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626403001306","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1588885340","https://openalex.org/W1973797056","https://openalex.org/W1997020216","https://openalex.org/W2045271686","https://openalex.org/W2102607950"],"related_works":["https://openalex.org/W2393491644","https://openalex.org/W4206577045","https://openalex.org/W650102067","https://openalex.org/W2740404111","https://openalex.org/W1550806730","https://openalex.org/W1496672428","https://openalex.org/W2589740103","https://openalex.org/W2397450670","https://openalex.org/W1966967794","https://openalex.org/W3086237447"],"abstract_inverted_index":{"Most":[0],"standard":[1],"parallel":[2,154],"join":[3,41,58,66,97,116],"algorithms":[4],"try":[5],"to":[6,54,73,151],"overcome":[7],"data":[8,19,28,51],"skews":[9],"with":[10],"a":[11,27,89,124,131],"relatively":[12],"static":[13],"approach.":[14],"The":[15,99],"way":[16],"they":[17],"distribute":[18],"(and":[20],"then":[21],"computation)":[22],"over":[23],"nodes":[24],"depends":[25],"on":[26,135],"re-distribution":[29],"algorithm":[30,129,146],"(hashing":[31],"or":[32],"range":[33],"partitioning)":[34],"that":[35,143],"is":[36],"determined":[37],"before":[38],"the":[39,44,65,128,136,152],"actual":[40],"begins.":[42],"On":[43],"contrary,":[45],"our":[46,81,94,144],"approach":[47,69],"consists":[48],"in":[49,52,80],"pre-scanning":[50],"order":[53],"choose":[55],"an":[56],"efficient":[57,75],"method":[59],"for":[60,106,156],"each":[61],"given":[62],"value":[63],"of":[64,93,101,114,127],"attribute.":[67],"This":[68],"has":[70],"already":[71],"proved":[72],"be":[74],"both":[76],"theoretically":[77],"and":[78,130],"practically":[79],"previous":[82],"papers.":[83],"In":[84],"this":[85],"paper":[86],"we":[87],"introduce":[88],"new":[90],"pipelined":[91,145],"version":[92,126,155],"frequency":[95],"adaptive":[96],"algorithm.":[98],"use":[100],"pipelining":[102],"offers":[103],"flexible":[104],"strategies":[105],"resource":[107],"allocation":[108],"while":[109,159],"avoiding":[110],"unnecessary":[111],"disk":[112],"input/output":[113],"intermediate":[115],"results":[117],"when":[118],"computing":[119],"multi-join":[120,157],"queries.":[121],"We":[122],"present":[123],"detailed":[125],"cost":[132],"analysis":[133],"based":[134],"BSP":[137],"(Bulk":[138],"Synchronous":[139],"Parallel)":[140],"model,":[141],"showing":[142],"achieves":[147],"noticeable":[148],"improvements":[149],"compared":[150],"sequential":[153],"queries":[158],"guaranteeing":[160],"perfect":[161],"balancing":[162],"properties.":[163]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}