{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:07:11Z","timestamp":1777637231015,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":[[1999,3]]},"DOI":"10.1016\/s0020-0255(98)10054-3","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T21:23:41Z","timestamp":1051219421000},"page":"187-204","source":"Crossref","is-referenced-by-count":8,"title":["A concurrency control algorithm for nearest neighbor query"],"prefix":"10.1016","volume":"114","author":[{"given":"J.K.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.H.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(98)10054-3_bib1","series-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","first-page":"322","article-title":"The R*-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0020-0255(98)10054-3_bib2","series-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","first-page":"519","article-title":"GENESYS: A system for efficient spatial query processing","author":"Brinkhoff","year":"1994"},{"issue":"Nos. 1\u20134","key":"10.1016\/S0020-0255(98)10054-3_bib3","first-page":"263","article-title":"A study of concurrent operations on R-trees","volume":"Vol. 98","author":"Chen","year":"1987","journal-title":"Inform. Sci."},{"key":"10.1016\/S0020-0255(98)10054-3_bib4","series-title":"Simulation model design and execution","author":"Fishwick","year":"1995"},{"key":"10.1016\/S0020-0255(98)10054-3_bib5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding the best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. on Math. Software"},{"key":"10.1016\/S0020-0255(98)10054-3_bib6","series-title":"Proceeding of ACM SIGMOD Annual Meeting","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"issue":"4","key":"10.1016\/S0020-0255(98)10054-3_bib7","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/69.63255","article-title":"A new methodology to evaluate locking protocols","volume":"2","author":"Huang","year":"1990","journal-title":"IEEE Trans. on Knowledge and Data Eng."},{"key":"10.1016\/S0020-0255(98)10054-3_bib8","series-title":"The Art of Computer Systems Performance Analysis","author":"Jain","year":"1991"},{"issue":"1","key":"10.1016\/S0020-0255(98)10054-3_bib9","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. on Database Systems"},{"key":"10.1016\/S0020-0255(98)10054-3_bib10","series-title":"Database: Principles, Programming, and Performance","author":"O'Neil","year":"1994"},{"key":"10.1016\/S0020-0255(98)10054-3_bib11","series-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","first-page":"485","article-title":"Paradise: A Database System for GIS Applications","year":"1995"},{"key":"10.1016\/S0020-0255(98)10054-3_bib12","series-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","first-page":"71","article-title":"Nearest Neighbor Queries","author":"Roussopoulos","year":"1995"},{"key":"10.1016\/S0020-0255(98)10054-3_bib13","series-title":"The Design and Analysis of Spatial Data Structure","author":"Samet","year":"1989"},{"key":"10.1016\/S0020-0255(98)10054-3_bib14","series-title":"Proceedings of the 13th VLDB Conference","first-page":"507","article-title":"The R+-tree: A dynamic index for multidimensional objects","author":"Sellis","year":"1987"},{"key":"10.1016\/S0020-0255(98)10054-3_bib15","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"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100543?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100543?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:21:40Z","timestamp":1556043700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025598100543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0020025598100543"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(98)10054-3","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}