{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:23Z","timestamp":1757629403588,"version":"3.44.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":[[1989,10]]},"DOI":"10.1016\/0743-7315(89)90020-8","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"256-278","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["A concurrent search structure"],"prefix":"10.1016","volume":"7","author":[{"given":"Jeff D.","family":"Parker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"The balanced cube: A concurrent data structure","year":"1985","author":"Dally","key":"10.1016\/0743-7315(89)90020-8_BIB1"},{"key":"10.1016\/0743-7315(89)90020-8_BIB2","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/TC.1980.1675680","article-title":"Concurrent search and insertion in AVL trees","volume":"C-29","author":"Ellis","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90020-8_BIB3","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."},{"key":"10.1016\/0743-7315(89)90020-8_BIB4","series-title":"Proc. 2nd ACM Symposium on Principles of Database Systems","first-page":"106","article-title":"Extendible hashing for concurrent operations and distributed data","author":"Ellis","year":"1983"},{"key":"10.1016\/0743-7315(89)90020-8_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/325405.325406","article-title":"Concurrency and linear hashing","author":"Ellis","year":"1985"},{"issue":"3","key":"10.1016\/0743-7315(89)90020-8_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Systems"},{"issue":"6","key":"10.1016\/0743-7315(89)90020-8_BIB7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90020-8_BIB8","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","article-title":"Concurrent manipulation of binary search trees","author":"Kung","year":"1980","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0743-7315(89)90020-8_BIB9","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":"4","key":"10.1016\/0743-7315(89)90020-8_BIB10","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1137\/0215082","article-title":"On maintaining dynamic information in a concurrent environment","volume":"15","author":"Manber","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/0743-7315(89)90020-8_BIB11","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(89)90020-8_BIB12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/1270.318576","article-title":"Concurrency control in a dynamic search structure","volume":"9","author":"Manber","year":"1984","journal-title":"ACM Trans. Database Systems"},{"year":"1984","author":"Mehlhorn","key":"10.1016\/0743-7315(89)90020-8_BIB13"},{"key":"10.1016\/0743-7315(89)90020-8_BIB14","series-title":"Proc. Allerton Conference","article-title":"The sibling trie: A highly concurrent search structure (preliminary version)","author":"Parker","year":"1986"},{"year":"1983","series-title":"Algorithms","author":"Sefgewick","key":"10.1016\/0743-7315(89)90020-8_BIB15"},{"year":"1985","series-title":"Interconnection Networks for Large Scale Parallel Processing: Theory and Case Studies","author":"Siegel","key":"10.1016\/0743-7315(89)90020-8_BIB16"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900208?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:31Z","timestamp":1757514631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0743731589900208"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90020-8","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A concurrent search structure","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(89)90020-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}