{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T14:08:36Z","timestamp":1673532516517},"reference-count":13,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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 Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0020-0255(02)00261-x","type":"journal-article","created":{"date-parts":[[2002,11,4]],"date-time":"2002-11-04T15:06:14Z","timestamp":1036422374000},"page":"123-142","source":"Crossref","is-referenced-by-count":4,"title":["Restructuring the concurrent B+-tree with non-blocked search operations"],"prefix":"10.1016","volume":"147","author":[{"given":"Sungchae","family":"Lim","sequence":"first","affiliation":[]},{"given":"Myoung Ho","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(02)00261-X_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","article-title":"Concurrency of operations on B-trees","volume":"9","author":"Bayer","year":"1977","journal-title":"Acta Informatica"},{"issue":"4","key":"10.1016\/S0020-0255(02)00261-X_BIB2","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operations","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Transactions on Database Systems"},{"issue":"3","key":"10.1016\/S0020-0255(02)00261-X_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","article-title":"A new method for concurrency in B-trees","volume":"8","author":"Kwong","year":"1982","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"10.1016\/S0020-0255(02)00261-X_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","article-title":"Concurrent operations on B\u2217-tree with overtaking","volume":"33","author":"Sagiv","year":"1986","journal-title":"Journal of Computer and System Science"},{"issue":"1","key":"10.1016\/S0020-0255(02)00261-X_BIB5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/42201.42204","article-title":"Concurrent search structure algorithms","volume":"13","author":"Shasha","year":"1988","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/141484.130338","article-title":"ARIES:IM: An efficient and high concurrency index management method using write-ahead logging","author":"Mohan","year":"1992","journal-title":"ACM SIGMOD"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB7","doi-asserted-by":"crossref","unstructured":"R. Ishak, Semantically consistent schedules for efficient and concurrent B-tree restructuring, in: International Conference on Data Engineering, August 1992, pp. 184\u2013191","DOI":"10.1109\/ICDE.1992.213193"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/235968.233325","article-title":"On-line reorganization of sparsely populated B+-trees","volume":"25","author":"Zou","year":"1996","journal-title":"ACM SIGMOD"},{"issue":"1","key":"10.1016\/S0020-0255(02)00261-X_BIB9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/202660.202666","article-title":"Implementing deletion in B+-trees","volume":"24","author":"Jannink","year":"1995","journal-title":"ACM SIGMOD RECORD"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB10","series-title":"Reading Mass","first-page":"449","article-title":"Transaction processing: concepts and techniques","author":"Gray","year":"1993"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263046","article-title":"Performance of B+ tree concurrency control algorithms","volume":"2","author":"Shrinivasan","year":"1993","journal-title":"VLDB Journal"},{"key":"10.1016\/S0020-0255(02)00261-X_BIB12","doi-asserted-by":"crossref","unstructured":"D. Lomet, B. Salzberg, Access method concurrency with recovery, in: ACM SIGMOD Conference, 1992, pp. 351\u2013360","DOI":"10.1145\/130283.130336"},{"issue":"1","key":"10.1016\/S0020-0255(02)00261-X_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/381854.381870","article-title":"Real-time index concurrency control","volume":"25","author":"Haritsa","year":"1996","journal-title":"SIGMOD Record"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002550200261X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002550200261X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T13:54:06Z","timestamp":1554386046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002550200261X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S002002550200261X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(02)00261-x","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}