{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:27:03Z","timestamp":1648794423818},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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,5]]},"DOI":"10.1016\/0020-0190(90)90016-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"313-321","source":"Crossref","is-referenced-by-count":4,"title":["Distributing A B+-tree in a loosely coupled environment"],"prefix":"10.1016","volume":"34","author":[{"given":"Gabriel","family":"Matsliach","sequence":"first","affiliation":[]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(90)90016-Q_BIB1","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/319989.319991","article-title":"Parallel algorithms for the execution of relational database operations","volume":"8","author":"Bitton","year":"1983","journal-title":"Trans. Databases Systems"},{"issue":"6","key":"10.1016\/0020-0190(90)90016-Q_BIB2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TSE.1982.235882","article-title":"Implementation of the database machine DIRECT","volume":"8","author":"Boral","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0190(90)90016-Q_BIB3","author":"Bradley","year":"1981"},{"issue":"2","key":"10.1016\/0020-0190(90)90016-Q_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surveys"},{"issue":"6","key":"10.1016\/0020-0190(90)90016-Q_BIB5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/TC.1979.1675379","article-title":"DIRECT\u2014A multiprocessor organization for supporting relational database management systems","volume":"28","author":"DeWitt","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(90)90016-Q_BIB6","first-page":"228","article-title":"GAMMA: A performance dataflow database machine","author":"DeWitt","year":"1986","journal-title":"Proc. Very Large Data Bases Conference"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB7","first-page":"106","article-title":"Extendible hashing for concurrent operations and distributed data","author":"Ellis","year":"1983","journal-title":"Proc. ACM-PODS Conference"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB8","first-page":"294","author":"Folk","year":"1987"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB9","first-page":"109","article-title":"A case for redundant arrays of inexpensive disks (RAID)","author":"Katz","year":"1988","journal-title":"Proc. ACM-SIGMOD Conference"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB10","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB11","article-title":"Methods for distributing a B+-tree in a loosely coupled environment","volume":"546","author":"Matsliach","year":"1989"},{"issue":"2","key":"10.1016\/0020-0190(90)90016-Q_BIB12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","article-title":"Concurrent operations on B+-trees with overtaking","volume":"33","author":"Sagiv","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(90)90016-Q_BIB13","article-title":"Concurrent algorithms for search structures","author":"Shasha","year":"1984"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB14","author":"Su","year":"1988"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB15","first-page":"36","author":"Ullman","year":"1982"},{"key":"10.1016\/0020-0190(90)90016-Q_BIB16","author":"Weiderhold","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090016Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090016Q?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:20:01Z","timestamp":1555089601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090016Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["002001909090016Q"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90016-q","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}