{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:31:46Z","timestamp":1648855906950},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":["Information Systems"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0306-4379(91)90023-3","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"627-639","source":"Crossref","is-referenced-by-count":1,"title":["Optimal parallel scheduling of M-way join queries"],"prefix":"10.1016","volume":"16","author":[{"given":"Farshad","family":"Fotouhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Leigh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyendra P","family":"Rana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0306-4379(91)90023-3_BIB1","article-title":"Iris: An object-oriented DBMS","volume":"5","author":"Fishman","year":"1987","journal-title":"ACM Trans. on Office Information Systems"},{"key":"10.1016\/0306-4379(91)90023-3_BIB2","series-title":"Proc. of ACM SIGMOD","first-page":"48","article-title":"Optimization of large join queries","author":"Swami","year":"1988"},{"key":"10.1016\/0306-4379(91)90023-3_BIB3","series-title":"Proc. 11th Int. Conf. on VLDB","first-page":"151","article-title":"Multiprocessor hash-based join algorithms","author":"DeWitt","year":"1985"},{"key":"10.1016\/0306-4379(91)90023-3_BIB4","series-title":"Proc. ACM SIGMOD","first-page":"23","article-title":"Access path selection in a relational database management system","author":"Selinger","year":"1979"},{"issue":"1","key":"10.1016\/0306-4379(91)90023-3_BIB5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/348.318590","article-title":"Join and semijoin algorithms for a parallel multiprocessor database machine","volume":"9","author":"Valduriez","year":"1984","journal-title":"ACM Trans. on Database Systems"},{"issue":"3","key":"10.1016\/0306-4379(91)90023-3_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/320473.320479","article-title":"Decomposition\u2014A strategy for query processing","volume":"1","author":"Wong","year":"1976","journal-title":"ACM Trans. on Database Systems"},{"issue":"3","key":"10.1016\/0306-4379(91)90023-3_BIB7","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1145\/1270.1498","article-title":"On the optimal nesting order for computing N-relational join","volume":"4","author":"Ibaraki","year":"1984","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0306-4379(91)90023-3_BIB8","series-title":"Proc. 12th Int. Conf. on VLDB","first-page":"128","article-title":"Optimization of nonrecursive queries","author":"Krishnamurthy","year":"1986"},{"key":"10.1016\/0306-4379(91)90023-3_BIB9","article-title":"Optimization of Large Join Queries","author":"Swami","year":"1989"},{"issue":"3","key":"10.1016\/0306-4379(91)90023-3_BIB10","first-page":"198","article-title":"The design and implementation of INGRES","volume":"1","author":"Stonebaker","year":"1976","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0306-4379(91)90023-3_BIB11","author":"Garey","year":"1979"},{"key":"10.1016\/0306-4379(91)90023-3_BIB12","series-title":"Proc. 6th Advanced Database Symp.","first-page":"215","article-title":"A new approach to optimizing the multi-relation join","author":"Zeng","year":"1986"},{"issue":"3","key":"10.1016\/0306-4379(91)90023-3_BIB13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/319989.319991","article-title":"Parallel algorithms for the execution of relational databases operations","volume":"8","author":"Bitton","year":"1983","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0306-4379(91)90023-3_BIB14","series-title":"Advanced Database Machine Architecture","author":"Hsiao","year":"1986"},{"key":"10.1016\/0306-4379(91)90023-3_BIB15","series-title":"Database Machines and Database Management","author":"Ozkarahan","year":"1986"},{"key":"10.1016\/0306-4379(91)90023-3_BIB16","series-title":"Proc. 12th Int. Conf. on VLDB","first-page":"228","article-title":"GAMMA\u2014A high performance dataflow database machine","author":"DeWitt","year":"1986"},{"key":"10.1016\/0306-4379(91)90023-3_BIB17","series-title":"Proc. ACM SIGMOD","first-page":"399","article-title":"Design and evaluation of pipelined join algorithms","author":"Richardson","year":"1987"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437991900233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437991900233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:55:27Z","timestamp":1552625727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437991900233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0306437991900233"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(91)90023-3","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}