{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:21:21Z","timestamp":1725618081209},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/icdew.2011.5767651","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T16:45:08Z","timestamp":1305650708000},"page":"4-9","source":"Crossref","is-referenced-by-count":4,"title":["A call for order in search space generation process of query optimization"],"prefix":"10.1109","author":[{"given":"Anisoara","family":"Nica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1871940.1871951"},{"article-title":"System and methodology for generating bushy trees using a left-deep tree join enumeration algorithm","year":"2007","author":"nica","key":"ref11"},{"key":"ref12","article-title":"A simple hypergraph min cut algorithm","author":"klimmek","year":"1996","journal-title":"Bericht FU Berlin Fachbereich Mathematik und Informatik Tech Rep B 96&#x2013;02"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66961"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247567"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/352958.352982"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872803"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559983"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559889"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050040"},{"key":"ref1","first-page":"314","article-title":"Measuring the complexity of join enumeration in query optimization","author":"ono","year":"1990","journal-title":"Proceedings of International Conference on Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2007.4401024"}],"event":{"name":"2011 IEEE International Conference on Data Engineering Workshops (ICDEW)","start":{"date-parts":[[2011,4,11]]},"location":"Hannover, Germany","end":{"date-parts":[[2011,4,16]]}},"container-title":["2011 IEEE 27th International Conference on Data Engineering Workshops"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5765044\/5767605\/05767651.pdf?arnumber=5767651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T01:33:08Z","timestamp":1490059988000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5767651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icdew.2011.5767651","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}