{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T22:22:01Z","timestamp":1699050121955},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf00289145","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:35:41Z","timestamp":1096911341000},"page":"421-438","source":"Crossref","is-referenced-by-count":5,"title":["Unsafe operations in B-trees"],"prefix":"10.1007","volume":"26","author":[{"given":"Bin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meichun","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large order indexes. Acta Inf. 1, 173?189 (1972)","journal-title":"Acta Inf."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11, 121?137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/3857.3858","volume":"10","author":"S. Huang","year":"1985","unstructured":"Huang, S.: Height-balanced trees of order (?, ?, ?). ACM Trans. Database Syst. 10, 261?284 (1985)","journal-title":"ACM Trans. Database Syst."},{"key":"CR4","volume-title":"The art of Computer Programming, Vol 3","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The art of Computer Programming, Vol 3. Reading, Mass.: Addison-Wesley 1973"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/319540.319565","volume":"6","author":"A.L. Rosenberg","year":"1981","unstructured":"Rosenberg, A.L., Snyder, L.: Time- and Space-optimality in B-trees. ACM Trans. Database Syst. 6, 174?193 (1981)","journal-title":"ACM Trans. Database Syst."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. Yao","year":"1978","unstructured":"Yao, A.: On random 2?3 trees. Acta Inf. 9, 159?170 (1978)","journal-title":"Acta Inf."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of Operations on B-trees. Acta Inf. 9, 1?21 (1977)","journal-title":"Acta Inf."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y. Sagiv","year":"1986","unstructured":"Sagiv, Y.: Concurrent Operations on B *-trees with Overtaking. J. Comput. Syst. Sci. 33, 275?296 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR9","unstructured":"Mond, Y., Raz, Y.: Concurrency control in B +-trees database using preparatory operations. Proceedings of the 11th International Conference on Very Large Data Bases, Stockholm, Sweden, pp. 331?334, 1985"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P. Lehman","year":"1981","unstructured":"Lehman, P., Yao, B.: Efficient Locking for Concurrent Operations on B-trees. ACM Trans. Database Syst. 6, 650?670 (1981)","journal-title":"ACM Trans. Database Syst."},{"key":"CR11","volume-title":"Probability Theory","author":"M. Loeve","year":"1977","unstructured":"Loeve, M.: Probability Theory. Berlin Heidelberg New York: Springer 1977"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(81)90101-0","volume":"12","author":"D. Maier","year":"1981","unstructured":"Maier, D., Salveter, S.: Hysterical B-trees. Inf. Process. Lett. 12, 199?202 (1981)","journal-title":"Inf. Process. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289145.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289145\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:41Z","timestamp":1554758081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF00289145"],"URL":"https:\/\/doi.org\/10.1007\/bf00289145","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}