{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:10Z","timestamp":1773481870076,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0169-023x(94)90014-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"197-222","source":"Crossref","is-referenced-by-count":58,"title":["Improvements on a heuristic algorithm for multiple-query optimization"],"prefix":"10.1016","volume":"12","author":[{"given":"Kyuseok","family":"Shim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Nau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(94)90014-0_BIB1","series-title":"Logic and Databases","author":"Gallaire","year":"1978"},{"key":"10.1016\/0169-023X(94)90014-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BF00999727","article-title":"On optimizing the evaluation of a set expressions","author":"Grant","year":"1982","journal-title":"Internat. J. Comput. Inform. Science"},{"issue":"4","key":"10.1016\/0169-023X(94)90014-0_BIB3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/08839519208949964","article-title":"Handling feature interactions in process planning","volume":"6","author":"Karinthi","year":"1992","journal-title":"Applied Artificial Intelligence"},{"key":"10.1016\/0169-023X(94)90014-0_BIB4","series-title":"Technical Report CS-TR-2540","article-title":"AI search for minimum-cost set cover and multiple-goal plan optimization problems: Applications to process planning","author":"Mahanti","year":"1990"},{"key":"10.1016\/0169-023X(94)90014-0_BIB5_1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(84)90004-3","article-title":"General branch and bound, and its relation to A\u2217 and AO\u2217","volume":"23","author":"Nau","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0169-023X(94)90014-0_BIB5_2","series-title":"Tech. Report TR-1170","author":"Nau","year":"1982"},{"key":"10.1016\/0169-023X(94)90014-0_BIB6","series-title":"Principle of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0169-023X(94)90014-0_BIB7","series-title":"Proc. 4th Internat. Conf. on Data Engineering","first-page":"311","article-title":"Using common subexpressions to optimized multiple queries","author":"Park","year":"1988"},{"key":"10.1016\/0169-023X(94)90014-0_BIB8","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0169-023X(94)90014-0_BIB9","series-title":"Technical Report LBL-27877","article-title":"Identifying common tasks in multiple access plans","author":"Segev","year":"1989"},{"key":"10.1016\/0169-023X(94)90014-0_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/42201.42203","article-title":"Multiple-query optimization","author":"Sellis","year":"1988","journal-title":"ACNM Trans. Database Syst."},{"key":"10.1016\/0169-023X(94)90014-0_BIB11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/69.54724","article-title":"On the multiple-query optimization problem","author":"Sellis","year":"1990","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0169-023X(94)90014-0_BIB12","series-title":"The implementation of a heuristic algorithm for the multiple-query optimization problem","author":"Sellis","year":"1988"},{"key":"10.1016\/0169-023X(94)90014-0_BIB13","series-title":"Technical Report CS-TR-3083, UMIACS-TR-93-48","article-title":"Improvements on a heuristic algorithm for the multiple-query optimization","author":"Shim","year":"1993"},{"key":"10.1016\/0169-023X(94)90014-0_BIB14","series-title":"Proc. 5th IEEE Conf. on AI Applications","article-title":"Planning for multiple goals with limited interactions","author":"Yang","year":"1989"},{"issue":"2","key":"10.1016\/0169-023X(94)90014-0_BIB15","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1111\/j.1467-8640.1992.tb00383.x","article-title":"Merging separately generated plans with restricted interactions","volume":"8","author":"Yang","year":"1992","journal-title":"Computational Intelligence"},{"key":"10.1016\/0169-023X(94)90014-0_BIB16","article-title":"Optimization of multiple-goal plans with limited interaction","author":"Yang","year":"1990"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X94900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X94900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:51:13Z","timestamp":1553615473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X94900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0169023X94900140"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(94)90014-0","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}