{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:33:54Z","timestamp":1742391234621},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"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 Processing Letters"],"published-print":{"date-parts":[[1985,7]]},"DOI":"10.1016\/0020-0190(85)90101-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"11-16","source":"Crossref","is-referenced-by-count":9,"title":["Join during merge: An improved sort based algorithm"],"prefix":"10.1016","volume":"21","author":[{"given":"M.","family":"Negri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Pelagatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90101-2_BIB1","series-title":"Proc. ACM\/SIGMOD Internat. Conf. on Management of Data","article-title":"A new way to compute the product and join of relations","author":"Kim","year":"1980"},{"issue":"2","key":"10.1016\/0020-0190(85)90101-2_BIB2","article-title":"Optimization of query evaluation algorithms","volume":"4","author":"Yao","year":"1979","journal-title":"ACM\/TODS"},{"issue":"4","key":"10.1016\/0020-0190(85)90101-2_BIB3","article-title":"Storage and access in relational data bases","volume":"16","author":"Blasgen","year":"1977","journal-title":"IBM Systems"},{"key":"10.1016\/0020-0190(85)90101-2_BIB4","series-title":"Sorting and Sort Systems","author":"Lorin","year":"1975"},{"issue":"1","key":"10.1016\/0020-0190(85)90101-2_BIB5","article-title":"Join and semijoin algorithms for a multiprocessor database machine","volume":"9","author":"Valduriez","year":"1984","journal-title":"ACM\/TODS"},{"key":"10.1016\/0020-0190(85)90101-2_BIB6","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0020-0190(85)90101-2_BIB7","article-title":"Duplicate record elimination in large data files","volume":"8","author":"Bitton","year":"1983","journal-title":"ACM\/TODS"},{"key":"10.1016\/0020-0190(85)90101-2_BIB8","series-title":"Advances in Computers","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0065-2458(08)60570-7","article-title":"Query optimization in distributed database systems","author":"Sacco","year":"1982"},{"issue":"3","key":"10.1016\/0020-0190(85)90101-2_BIB9","article-title":"On optimizing and SQL-like nested query","volume":"7","author":"Kim","year":"1982","journal-title":"ACM\/TODS"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085901012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085901012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:27:28Z","timestamp":1553578048000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085901012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0020019085901012"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90101-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}