{"id":"https://openalex.org/W2018066365","doi":"https://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","title":"Parallel join for IBGF partitioned relational databases","display_name":"Parallel join for IBGF partitioned relational databases","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2018066365","doi":"https://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","mag":"2018066365"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5056037815","display_name":"M\u00fcslim Bozyi\u011fit","orcid":null},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"M. Bozyigit","raw_affiliation_strings":["Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008396407","display_name":"Salahadin Mohammed","orcid":"https://orcid.org/0000-0002-2660-4369"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"S. A. Mohammed","raw_affiliation_strings":["Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006389944","display_name":"M. Al\u2010Tayyeb","orcid":null},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"M. Al-Tayyeb","raw_affiliation_strings":["Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Information & Computer Science Department, King Fahd University of Petroleum & Minerals, PO Box 1619, Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056037815"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18154877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"8","first_page":"821","last_page":"836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8625738620758057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7877836227416992},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6010318398475647},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.580700159072876},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.5605277419090271},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4878261387348175},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.46932336688041687},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4312613606452942},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36602193117141724},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.3434688448905945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34256359934806824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32090258598327637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14000621438026428},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13046804070472717}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.8625738620758057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7877836227416992},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6010318398475647},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.580700159072876},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.5605277419090271},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4878261387348175},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.46932336688041687},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4312613606452942},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36602193117141724},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.3434688448905945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34256359934806824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32090258598327637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14000621438026428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13046804070472717},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1096-9128(199708)9:8<821::aid-cpe268>3.0.co;2-o","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1509342228","https://openalex.org/W1566364654","https://openalex.org/W1981889860","https://openalex.org/W1989002177","https://openalex.org/W2005272677","https://openalex.org/W2014820311","https://openalex.org/W2051244613","https://openalex.org/W2098836692","https://openalex.org/W2115919907","https://openalex.org/W2118112332","https://openalex.org/W2124170481","https://openalex.org/W2295596515","https://openalex.org/W3189934495"],"related_works":["https://openalex.org/W2381211091","https://openalex.org/W2091359263","https://openalex.org/W1866159721","https://openalex.org/W4234452035","https://openalex.org/W2469706965","https://openalex.org/W1989231289","https://openalex.org/W2334867751","https://openalex.org/W3033055359","https://openalex.org/W4242221889","https://openalex.org/W1589496614"],"abstract_inverted_index":{"This":[0],"study":[1],"is":[2,76,93,124],"concerned":[3],"with":[4,41,88,109],"a":[5,32,51],"parallel":[6,54],"join":[7,47,78,84],"operation":[8],"where":[9],"the":[10,42,72,83,99,127],"subject":[11],"relations":[12,26],"are":[13,29,107,114],"partitioned":[14,25,65],"according":[15],"to":[16,77,95,116],"an":[17],"interpolation":[18],"based":[19],"grid":[20],"file":[21],"(IBGF)":[22],"scheme.":[23],"The":[24,46,91,112],"and":[27,70,101],"directories":[28],"distributed":[30],"over":[31],"set":[33],"of":[34,59,82],"independently":[35],"accessible":[36],"external":[37],"storage":[38],"units,":[39],"together":[40],"partitioning":[43],"control":[44],"data.":[45],"algorithms":[48,113],"executed":[49],"by":[50,105],"mesh":[52],"type":[53],"computing":[55],"system":[56],"allow":[57],"handling":[58],"uniform":[60],"as":[61,63,98],"well":[62],"nonuniformly":[64],"relations.":[66],"Each":[67],"processor":[68],"locates":[69],"retrieves":[71],"data":[73],"partitions":[74],"it":[75],"at":[79],"each":[80],"step":[81],"process,":[85],"in":[86],"synchronisation":[87],"other":[89],"processors.":[90],"approach":[92],"found":[94,104],"be":[96],"feasible":[97],"speedup":[100],"efficiency":[102],"results":[103],"simulation":[106],"consistent":[108],"theoretical":[110],"bounds.":[111],"tuned":[115],"join-key":[117],"distributions,":[118],"so":[119],"that":[120],"effective":[121],"load":[122],"balancing":[123],"achieved":[125],"during":[126],"actual":[128],"join.":[129],"\u00a9":[130],"1997":[131],"John":[132],"Wiley":[133],"&":[134],"Sons,":[135],"Ltd.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}