{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:10Z","timestamp":1757629390302,"version":"3.44.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0743-7315(90)90100-4","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"253-266","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the performance of concurrent tree algorithms"],"prefix":"10.1016","volume":"8","author":[{"given":"Ray","family":"Ford","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Dipping","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Shultz","sequence":"additional","affiliation":[]},{"given":"Brion","family":"Wenhardt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90100-4_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 Inform."},{"key":"10.1016\/0743-7315(90)90100-4_BIB2","first-page":"97","article-title":"An abstract model of database concurrency control algorithms","volume":"13","author":"Carey","year":"1983"},{"issue":"9","key":"10.1016\/0743-7315(90)90100-4_BIB3","first-page":"811","article-title":"Concurrent search and insertion in AVL trees","volume":"C-29","author":"Ellis","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(90)90100-4_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289064","article-title":"Concurrent search and insertion in 2\u20133 trees","volume":"14","author":"Ellis","year":"1980","journal-title":"Acta Inform."},{"article-title":"On the performance of an optimistic concurrent tree algorithm","year":"1985","author":"Ford","key":"10.1016\/0743-7315(90)90100-4_BIB5"},{"issue":"1","key":"10.1016\/0743-7315(90)90100-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3148.3160","article-title":"Limitations of concurrency in transaction processing","volume":"10","author":"Franaszek","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0743-7315(90)90100-4_BIB7","series-title":"Proc. 6th International Conference on Distributed Computing Systems","first-page":"130","article-title":"Performance evaluation of integrated concurrency control and recovery algorithms using a distributed transaction processing testbed","author":"Kohler","year":"1986"},{"key":"10.1016\/0743-7315(90)90100-4_BIB8","first-page":"108","article-title":"An experimental comparison of locking policies in a testbed database system","volume":"13","author":"Kohler","year":"1983"},{"issue":"3","key":"10.1016\/0743-7315(90)90100-4_BIB9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","article-title":"Concurrent manipulation of binary search trees","volume":"5","author":"Kung","year":"1980","journal-title":"ACM Trans. Database Systems"},{"issue":"6","key":"10.1016\/0743-7315(90)90100-4_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/319566.319567","article-title":"On optimistic methods for concurrency control","volume":"6","author":"Kung","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0743-7315(90)90100-4_BIB11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","article-title":"A new method for concurrency in B-trees","volume":"SE-8","author":"Kwong","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/0743-7315(90)90100-4_BIB12","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operations on B-trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"6","key":"10.1016\/0743-7315(90)90100-4_BIB13","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TSE.1984.5010306","article-title":"Concurrent maintenance of binary search trees","volume":"SE-10","author":"Manber","year":"1984","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/0743-7315(90)90100-4_BIB14","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/1270.318576","article-title":"Concurrency control in a dynamic search environment","volume":"9","author":"Manber","year":"1983","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0743-7315(90)90100-4_BIB15","unstructured":"Peinl P., Reuter A. Empirical comparison of database concurrency control schemes, Proc. Ninth Conference on Very Large Data Bases, 97\u2013108."},{"issue":"4","key":"10.1016\/0743-7315(90)90100-4_BIB16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","article-title":"B-trees in a system with multiple users","volume":"5","author":"Samadi","year":"1976","journal-title":"Inform. Process. Lett."},{"article-title":"Simulation of multiprocessor computer architectures using ACL","year":"1983","author":"Shultz","key":"10.1016\/0743-7315(90)90100-4_BIB17"},{"article-title":"Controlling testbed database characteristics","year":"1986","author":"Shultz","key":"10.1016\/0743-7315(90)90100-4_BIB18"},{"key":"10.1016\/0743-7315(90)90100-4_BIB19","series-title":"Proc. Third Symposium on Reliability in Distributed Software and Database Systems","first-page":"135","article-title":"Performance analysis of distributed data base systems","author":"Stonebraker","year":"1983"},{"issue":"4","key":"10.1016\/0743-7315(90)90100-4_BIB20","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TSE.1985.232224","article-title":"Performance evaluation of centralized databases with static locking","volume":"SE-11","author":"Thomasian","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(90)90100-4_BIB21","series-title":"Proc. 1984 International Conference on Parallel Processing","article-title":"Performance prediction for multiprocessor systems","author":"Vrsalovic","year":"1984"},{"article-title":"A comparison of concurrency control algorithms for distributed data access","year":"1986","author":"Wenhardt","key":"10.1016\/0743-7315(90)90100-4_BIB22"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901004?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901004?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:25Z","timestamp":1757514625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731590901004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0743731590901004"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90100-4","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the performance of concurrent tree algorithms","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90100-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}