{"id":"https://openalex.org/W2058219274","doi":"https://doi.org/10.1145/1559845.1559853","title":"Dependency-aware reordering for parallelizing query optimization in multi-core CPUs","display_name":"Dependency-aware reordering for parallelizing query optimization in multi-core CPUs","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W2058219274","doi":"https://doi.org/10.1145/1559845.1559853","mag":"2058219274"},"language":"en","primary_location":{"id":"doi:10.1145/1559845.1559853","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","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/A5035744252","display_name":"Wook-Shin Han","orcid":"https://orcid.org/0000-0001-9206-9563"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Wook-Shin Han","raw_affiliation_strings":["Kyungpook National University, Daegu, South Korea"],"affiliations":[{"raw_affiliation_string":"Kyungpook National University, Daegu, South Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055974749","display_name":"Jin\u2010Soo Lee","orcid":"https://orcid.org/0000-0001-8899-4043"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinsoo Lee","raw_affiliation_strings":["Kyungpook National University, Daegu, South Korea"],"affiliations":[{"raw_affiliation_string":"Kyungpook National University, Daegu, South Korea","institution_ids":["https://openalex.org/I31419693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035744252"],"corresponding_institution_ids":["https://openalex.org/I31419693"],"apc_list":null,"apc_paid":null,"fwci":3.1815,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91660264,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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.996999979019165,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.8993456363677979},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6781868934631348},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.6195052266120911},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5957605838775635},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5156282782554626},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4735148251056671},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4467422068119049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39858245849609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24841663241386414},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15075871348381042},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12964612245559692},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09941399097442627}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8993456363677979},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6781868934631348},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.6195052266120911},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5957605838775635},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5156282782554626},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4735148251056671},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4467422068119049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39858245849609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24841663241386414},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15075871348381042},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12964612245559692},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09941399097442627},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1559845.1559853","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.617.1280","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.617.1280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rosaec.snu.ac.kr/publish/2009/T3/HaLe-SIGMOD-2009.pdf","raw_type":"text"},{"id":"pmh:oai:oasis.postech.ac.kr:2014.oak/37666","is_oa":false,"landing_page_url":"https://oasis.postech.ac.kr/handle/2014.oak/37666","pdf_url":null,"source":{"id":"https://openalex.org/S4306401965","display_name":"Open Access System for Information Sharing (Pohang University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123900574","host_organization_name":"Pohang University of Science and Technology","host_organization_lineage":["https://openalex.org/I123900574"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W57462620","https://openalex.org/W304606221","https://openalex.org/W1499618177","https://openalex.org/W1509342228","https://openalex.org/W1537270633","https://openalex.org/W1589271613","https://openalex.org/W1804205637","https://openalex.org/W1975278491","https://openalex.org/W1978220611","https://openalex.org/W1981925480","https://openalex.org/W2016559894","https://openalex.org/W2019102956","https://openalex.org/W2021008769","https://openalex.org/W2027259333","https://openalex.org/W2054961017","https://openalex.org/W2058219274","https://openalex.org/W2060847221","https://openalex.org/W2070320107","https://openalex.org/W2075284083","https://openalex.org/W2091323258","https://openalex.org/W2101922257","https://openalex.org/W2118245937","https://openalex.org/W2136632987","https://openalex.org/W2144756257","https://openalex.org/W2149849691","https://openalex.org/W2151563502","https://openalex.org/W2151826520","https://openalex.org/W2153180521","https://openalex.org/W2159972990","https://openalex.org/W2164202285","https://openalex.org/W2164645353","https://openalex.org/W2170273603","https://openalex.org/W2170918251","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4238121600","https://openalex.org/W4244215662","https://openalex.org/W4246219036","https://openalex.org/W6632402174","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W2136735429","https://openalex.org/W2088925915","https://openalex.org/W170547082","https://openalex.org/W2382891957","https://openalex.org/W2378924333","https://openalex.org/W2362446711","https://openalex.org/W1495801388","https://openalex.org/W2551308855","https://openalex.org/W1760549314"],"abstract_inverted_index":{"The":[0,28],"state":[1,62,162],"of":[2,30,45,57,63,93,137,163,198,219,231,241,252,259,291],"the":[3,18,35,43,48,54,64,79,90,109,129,141,184,190,267,302],"art":[4,65,164],"commercial":[5],"query":[6,20,37,49,82,281],"optimizers":[7,166],"employ":[8],"cost-based":[9],"optimization":[10,67,83,255,312],"and":[11,118,145,151,171,263,271],"exploit":[12],"dynamic":[13,148],"programming":[14],"(DP)":[15],"to":[16,71,77,95,99,177,180,203,310,321,339],"find":[17],"optimal":[19],"execution":[21],"plan":[22,264],"(QEP)":[23],"without":[24],"evaluating":[25],"redundant":[26],"sub-plans.":[27],"number":[29,44],"alternative":[31],"QEPs":[32],"enumerated":[33],"by":[34,52,239],"DP":[36,81,94,111,165],"optimizer":[38,210,317],"can":[39],"increase":[40],"exponentially,":[41],"as":[42,72,168,211],"joins":[46],"in":[47,183,222],"increases.":[50],"Recently,":[51],"exploiting":[53,122],"coming":[55],"wave":[56],"multi-core":[58],"processor":[59],"architectures,":[60],"a":[61,156,196,207,215,223,228,250],"parallel":[66,316],"algorithm":[68],"[14],":[69],"referred":[70],"PDPsva,":[73],"has":[74,103],"been":[75],"proposed":[76],"parallelize":[78,178],"\"time-consuming\"":[80],"process":[84],"itself.":[85],"While":[86],"PDPsva":[87,319,336],"significantly":[88],"extends":[89],"practical":[91],"use":[92],"queries":[96],"having":[97],"up":[98,293],"20-25":[100],"tables,":[101],"it":[102],"several":[104],"limitations:":[105],"1)":[106,257],"supporting":[107,147],"only":[108],"size-driven":[110,322],"enumerator,":[112],"2)":[113,266],"statically":[114],"allocating":[115],"search":[116,149,340],"space,":[117],"3)":[119,272],"not":[120],"fully":[121],"parallelism.":[123,153],"In":[124],"this":[125],"paper,":[126],"we":[127,226,247,283],"propose":[128,227],"first":[130],"generic":[131,315],"solution":[132,191,287,306,330],"for":[133,146,298],"parallelizing":[134],"any":[135,289],"type":[136,290],"bottom-up":[138,209],"optimizer,":[139],"including":[140],"graph-traversal":[142],"driven":[143],"type,":[144],"allocation":[150],"full":[152],"This":[154],"is":[155,192,307,331],"challenging":[157],"problem,":[158],"since":[159],"recently":[160],"developed,":[161],"such":[167],"DPcpp":[169],"[21]":[170],"DPhyp":[172],"[22]":[173],"are":[174,201],"very":[175,193],"difficult":[176],"due":[179,309],"tangled":[181],"dependencies":[182,240],"join":[185,220,242,260],"pairs":[186,221],"they":[187],"generate.":[188],"Unless":[189],"carefully":[194],"devised,":[195],"lot":[197],"synchronization":[199],"conflicts":[200],"bound":[202],"occur.":[204],"By":[205],"viewing":[206],"serial":[208],"one":[212],"which":[213,234],"generates":[214],"totally":[216],"ordered":[217],"sequence":[218],"streaming":[224],"fashion,":[225],"novel":[229,253],"concept":[230],"dependency-aware":[232],"reordering,":[233],"minimizes":[235],"waiting":[236],"time":[237],"caused":[238],"pairs.":[243],"To":[244],"maximize":[245],"parallelism,":[246],"also":[248,326],"introduce":[249],"series":[251],"performance":[254],"techniques:":[256],"pipelining":[258],"pair":[261],"generation":[262],"generation;":[265],"synchronization-free":[268],"global":[269],"MEMO;":[270],"threading":[273],"across":[274],"dependencies.":[275],"Through":[276],"extensive":[277],"experiments":[278],"with":[279,337],"various":[280],"topologies,":[282],"show":[284,327],"that":[285,304,328],"our":[286,305,314,329],"supports":[288],"bottom":[292],"optimization,":[294],"achieving":[295],"linear":[296],"speedup":[297],"each":[299],"type.":[300],"Despite":[301],"fact":[303],"generic,":[308],"sophisticated":[311],"techniques,":[313],"outperforms":[318],"tailored":[320],"enumeration.":[323],"Experimental":[324],"results":[325],"much":[332],"more":[333],"robust":[334],"than":[335],"respect":[338],"space":[341],"allocation.":[342]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}