{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:59:39Z","timestamp":1783605579787,"version":"3.55.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":[[1997,5]]},"DOI":"10.1016\/s0020-0255(96)00219-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"263-300","source":"Crossref","is-referenced-by-count":26,"title":["A study of concurrent operations on R-trees"],"prefix":"10.1016","volume":"98","author":[{"given":"J.K.","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.F.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.H.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(96)00219-8_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Informatica"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB2","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"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB3","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"322","article-title":"The R\u2217-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB4","series-title":"Concurrency Control and Recovery in Database Systems","author":"Berstein","year":"1987"},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0255(89)90035-2","article-title":"Operation-specific locking in balanced structures","volume":"48","author":"Biliris","year":"1989","journal-title":"Inform. Sci."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB6","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"519","article-title":"GeneSys: A system for efficient spatial query processing","author":"Brinkhoff","year":"1994"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB7","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 Computing Surveys"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB8","volume":"Vol. I","author":"Date","year":"1986"},{"issue":"9","key":"10.1016\/S0020-0255(96)00219-8_BIB9","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\/S0020-0255(96)00219-8_BIB10","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 Informatica"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB11","series-title":"Proc. Winter Simulation Conf.","first-page":"154","article-title":"SIMPACK: Getting started with simulation programming in C and C++","author":"Fishwick","year":"1992"},{"issue":"2","key":"10.1016\/S0020-0255(96)00219-8_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356842.356847","article-title":"The recovery manager of the system R database manager","volume":"13","author":"Gray","year":"1981","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB13","series-title":"Proc. ACM SIGMOD Annual Meeting","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB14","series-title":"The Art of Computer Systems Performance Analysis","author":"Jain","year":"1991"},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/151284.151286","article-title":"The performance of current B-tree algorithms","volume":"18","author":"Johnson","year":"1993","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB16","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"195","article-title":"Parallel R-trees","author":"Kamel","year":"1992"},{"issue":"3","key":"10.1016\/S0020-0255(96)00219-8_BIB17","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":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/S0020-0255(96)00219-8_BIB18","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 Syst."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB19","series-title":"Proc. ACM Conf. on Language Design for Reliable Software","first-page":"128","article-title":"Process structuring, synchronization, and recovery using atomic actions","author":"Lomet","year":"1977"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB20","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"351","article-title":"Access method concurrency with recovery","author":"Lomet","year":"1992"},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/128765.128770","article-title":"ARIES: A transaction recovery method supporting fine-granularity locking and partial rollback using write-ahead logging","volume":"17","author":"Mohan","year":"1992","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB22","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"371","article-title":"ARIES\/IM: An efficient and high concurrency index management method using write-ahead logging","author":"Mohan","year":"1992"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB23","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-56869-7_9","article-title":"Concurrent accesses to R-trees, SSD'93","volume":"692","author":"Ng","year":"1993","journal-title":"Lecture Notes in Computer Science (LNCS)"},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB24","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The grid file: An adaptable, symmetric multikey file structure","volume":"9","author":"Nievergelt","year":"1984","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB25","series-title":"Proc. ACM SIGMOD Int. Conf. on Management Data","first-page":"10","article-title":"The K-D-B tree: A search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB26","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"17","article-title":"Direct spatial search on pictorial databases using packed R-trees","author":"Roussopoulos","year":"1985"},{"issue":"4","key":"10.1016\/S0020-0255(96)00219-8_BIB27","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":"Information Processing Lett."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB28","series-title":"Proc. 13th VLDB Conf.","first-page":"507","article-title":"The R+-tree: A dynamic index for multi-dimensional objects","author":"Sellis","year":"1987"},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB29","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 Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00219-8_BIB30","series-title":"Operating System Concept","author":"Silberschatz","year":"1991"},{"key":"10.1016\/S0020-0255(96)00219-8_BIB31","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263046","article-title":"Performance of B+-trees concurrency control algorithms","volume":"2","author":"Srinivasan","year":"1993","journal-title":"VLDB J."},{"issue":"1","key":"10.1016\/S0020-0255(96)00219-8_BIB32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/69.50912","article-title":"The implementation of POSTGRES","volume":"2","author":"Stonebraker","year":"1990","journal-title":"IEEE Trans. Knowledge and Data Engrg."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596002198?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596002198?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:09Z","timestamp":1556058429000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025596002198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":32,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0020025596002198"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(96)00219-8","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}