{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:36:44Z","timestamp":1648597004683},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":[[1990,10]]},"DOI":"10.1016\/0020-0190(90)90102-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"85-90","source":"Crossref","is-referenced-by-count":0,"title":["An upper bound on buffer size for join operation using nonclustered indexes"],"prefix":"10.1016","volume":"36","author":[{"given":"Jae Moon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jong Soo","family":"Park","sequence":"additional","affiliation":[]},{"given":"Myunghwan","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90102-4_BIB1","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(90)90102-4_BIB2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(89)90030-6","article-title":"Hybrid join: an improved sortedbased join algorithm","volume":"32","author":"Choi","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90102-4_BIB3","series-title":"an O(\u221a\u00a6E\u00a6) algorithm for finding maximum matchings in general graphs","first-page":"17","year":"1980"},{"issue":"1","key":"10.1016\/0020-0190(90)90102-4_BIB4","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/32.21722","article-title":"Heuristics for join processing using nonclustered indexes","volume":"15","author":"Omiencinski","year":"1989","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0020-0190(90)90102-4_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/3148.3325","article-title":"Use of graph-theoretic models for optimal relational database accesses to perform join","volume":"10","author":"Pramanik","year":"1985","journal-title":"ACM Trans. Database Systems"},{"issue":"2","key":"10.1016\/0020-0190(90)90102-4_BIB6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090901024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:21:16Z","timestamp":1555089676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090901024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0020019090901024"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90102-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}