{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:55:55Z","timestamp":1729652155675,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1109\/icde.2012.27","type":"proceedings-article","created":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T17:38:33Z","timestamp":1341941913000},"page":"414-425","source":"Crossref","is-referenced-by-count":11,"title":["Effective and Robust Pruning for Top-Down Join Enumeration Algorithms"],"prefix":"10.1109","author":[{"given":"Pit","family":"Fender","sequence":"first","affiliation":[]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Viktor","family":"Leis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s007780050040","article-title":"Heuristic and randomized optimization for the join ordering problem","volume":"6","author":"steinbrunn","year":"1997","journal-title":"The VLDB Journal"},{"key":"14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/235968.233317","article-title":"Rapid bushy join-order optimization with cartesian products","author":"vance","year":"1996","journal-title":"SIGMOD"},{"key":"11","article-title":"A new heuristic for optimizing large queries","author":"fegaras","year":"1998","journal-title":"DEXA"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559889"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247567"},{"key":"2","first-page":"930","article-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","journal-title":"VLDB"},{"key":"1","article-title":"Measuring the complexity of join enumeration in query optimization","author":"ono","year":"1990","journal-title":"VLDB"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050043"},{"key":"7","article-title":"The cascades framework for query optimization","volume":"18","author":"graefe","year":"1995","journal-title":"IEEE Data Eng Bull"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1993.344061"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.235"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767901"},{"journal-title":"Optimal Top-down Join Enumeration (Extended Version)","year":"2007","author":"dehaan","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.2001.938068"}],"event":{"name":"2012 IEEE International Conference on Data Engineering (ICDE 2012)","start":{"date-parts":[[2012,4,1]]},"location":"Arlington, VA, USA","end":{"date-parts":[[2012,4,5]]}},"container-title":["2012 IEEE 28th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6226952\/6228063\/06228102.pdf?arnumber=6228102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:11:23Z","timestamp":1497978683000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6228102\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icde.2012.27","relation":{},"subject":[],"published":{"date-parts":[[2012,4]]}}}