{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:39:58Z","timestamp":1725791998650},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319069319"},{"type":"electronic","value":"9783319069326"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06932-6_2","type":"book-chapter","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T07:14:18Z","timestamp":1397805258000},"page":"10-19","source":"Crossref","is-referenced-by-count":2,"title":["The exIWO Metaheuristic \u2013 A Recapitulation of the Research on the Join Ordering Problem"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kostrzewa","sequence":"first","affiliation":[]},{"given":"Henryk","family":"Josi\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T. Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: Optimal nesting for computing N-relational joins. ACM Transactions on Database Systems\u00a09(3), 482\u2013502 (1984)","journal-title":"ACM Transactions on Database Systems"},{"key":"2_CR2","series-title":"AISC","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-00563-3_53","volume-title":"Man-Machine Interactions","author":"D. Kostrzewa","year":"2009","unstructured":"Kostrzewa, D., Josi\u0144ski, H.: The Comparison of an Adapted Evolutionary Algorithm with the Invasive Weed Optimization Algorithm Based on the Problem of Predetermining the Progress of Distributed Data Merging Process. In: Cyran, K.A., Kozielski, S., Peters, J.F., Sta\u0144czyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. AISC, vol.\u00a059, pp. 505\u2013514. Springer, Heidelberg (2009)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-29353-5_31","volume-title":"Swarm and Evolutionary Computation","author":"D. Kostrzewa","year":"2012","unstructured":"Kostrzewa, D., Josi\u0144ski, H.: The Modified IWO Algorithm for Optimization of Numerical Functions. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) SIDE 2012 and EC 2012. LNCS, vol.\u00a07269, pp. 267\u2013274. Springer, Heidelberg (2012)"},{"key":"2_CR4","unstructured":"Kostrzewa, D., Josi\u0144ski, H.: Using the Expanded IWO Algorithm to Solve the Traveling Salesman Problem. In: 5th International Conference on Agents and Artificial Intelligence (ICAART 2013), pp. 451\u2013456 (2013)"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"R. Mehrabian","year":"2006","unstructured":"Mehrabian, R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics\u00a01(4), 355\u2013366 (2006)","journal-title":"Ecological Informatics"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer (2004)","DOI":"10.1007\/978-3-662-07807-5"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s007780050040","volume":"6","author":"M. Steinbrunn","year":"1997","unstructured":"Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. The VLDB Journal\u00a06, 191\u2013208 (1997)","journal-title":"The VLDB Journal"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/BFb0056922","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"G. Tao","year":"1998","unstructured":"Tao, G., Michalewicz, Z.: Inver-over Operator for the TSP. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 803\u2013812. Springer, Heidelberg (1998)"}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures, and Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06932-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T19:45:06Z","timestamp":1676835906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06932-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319069319","9783319069326"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06932-6_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}