{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T23:34:24Z","timestamp":1677022464887},"reference-count":10,"publisher":"International Academy Publishing (IAP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.6.10.2004-2012","type":"journal-article","created":{"date-parts":[[2011,9,27]],"date-time":"2011-09-27T08:43:40Z","timestamp":1317113020000},"source":"Crossref","is-referenced-by-count":2,"title":["Optimization Strategy of Top-Down Join Enumeration on Modern Multi-Core CPUs"],"prefix":"10.17706","volume":"6","author":[{"given":"Wanli","family":"Zuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengling","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2011,10,1]]},"reference":[{"key":"ref1","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2001","edition":"2nd Edition"},{"key":"ref2","volume-title":"Multicore and gpus, \u201cOne tool, two processors","author":"Erickson","year":"2007"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.14778\/1453856.1453882","volume-title":"Parallelizing query optimization","author":"Han","year":"2008"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1109\/IPDPS.2007.370205","volume-title":"Ipdps panel, \u201cIs the multi-core roadmap going to live up to its promises?","author":"Stenstrom","year":"2007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1095408.1095421"},{"key":"ref6","volume-title":"Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products","author":"Moerkotte","year":"2006"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1145\/1376616.1376672","volume-title":"Dynamic programming strikes back","author":"Moerkotte","year":"2008"},{"key":"ref8","first-page":"19","article-title":"The Cascades framework for query optimization","volume":"18","author":"Graefe","year":"1995","journal-title":"Q. Bull. Comput. Soc. IEEE Tech. Comm. Data Eng.","ISSN":"http:\/\/id.crossref.org\/issn\/1053-1238","issn-type":"print"},{"key":"ref9","first-page":"20","article-title":"Exploiting Upper and Lower Bounds","volume-title":"Top-Down Query Optimization","author":"Shapiro","year":"2001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/244810.244812"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T11:15:13Z","timestamp":1560683713000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/5019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,1]]},"references-count":10,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2011,10,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.6.10.2004-2012","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2011,10,1]]}}}