{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T11:27:06Z","timestamp":1746271626963},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s00778-004-0140-6","type":"journal-article","created":{"date-parts":[[2004,9,14]],"date-time":"2004-09-14T17:18:29Z","timestamp":1095182309000},"page":"257-277","source":"Crossref","is-referenced-by-count":50,"title":["Concurrency control and recovery for balanced B-link trees"],"prefix":"10.1007","volume":"14","author":[{"given":"Ibrahim","family":"Jaluta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seppo","family":"Sippu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Bernstein P, Hadzilacos V, Goodman N (1987) Concurrency control and recovery in database systems. Addison-Wesley, Reading, MA"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Biliris A (1987) Operation specific locking in B-trees. In: Proc. 1987 ACM international conference on principles of database systems, pp 159-169","DOI":"10.1145\/28659.28676"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Chen I, Hassan S (1995) Performance analysis of a periodic data reorganization algorithm for concurrent B-link trees in database systems. In: Proc. 1995 ACM symposium on applied computing, pp 40-45","DOI":"10.1145\/315891.315901"},{"key":"CR4","unstructured":"Cosmadakis S, Ioannidou K, Stergiou S (2001) View serializable updates of concurrent index structures. In: Proc. 2001 DBPL international workshop on database programming languages, pp 247-262"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"De Jonge W, Schijf A (1990) Concurrent access to B-trees. In: Proc. 1990 PARBASE international conference on databases, parallel architectures and their applications, pp 312-320","DOI":"10.1109\/PARBSE.1990.77156"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Fu A, Kameda T (1989) Concurrency control for nested transactions accessing B-trees. In: Proc. ACM SIGACT-SIGMOD-SIGART international conference on management of data, pp 270-285","DOI":"10.1145\/73721.73749"},{"key":"CR7","first-page":"concepts","volume":"processing","author":"Gray","year":"1993","unstructured":"Gray J, Reuter A (1993) Transaction processing: concepts and techniques. Morgan Kaufmann, San Francisco","journal-title":"Transaction"},{"key":"CR8","unstructured":"Goyal B, Haritsa J, Seshadri S, Srinivasan V (1995) Index concurrency control in firm real-time DBMS. In: Proc. 21st VLDB conference, pp 146-157"},{"key":"CR9","unstructured":"Jaluta I (2002) B-tree concurrency control and recovery in a client-server database management system. Ph.D. thesis and report TKO-A37\/02, Department of Computer Science and Engineering, Helsinki University of Technology. http:\/\/lib.hut.fi\/Diss\/2002\/isbn9512257068\/"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/51708.51714","volume":"17","author":"Keller","year":"1988","unstructured":"Keller AM, Wiederhold G (1988) Concurrent use of B-trees with variable-length entries. SIGMOD Rec 17(2):89-90","journal-title":"SIGMOD Rec"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Kornacker M, Mohan C, Hellerstein J (1997) Concurrency and recovery in generalized search trees. In: Proc. ACM SIGMOD international conference on management of data, pp 62-72","DOI":"10.1145\/253260.253272"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","volume":"8","author":"Kwong","year":"1982","unstructured":"Kwong Y, Wood D (1982) A new method for concurrency in B-trees. IEEE Trans Softw Eng 8:211-222","journal-title":"IEEE Trans Softw Eng"},{"key":"CR13","unstructured":"Lanin V, Shasha D (1986) A symmetric concurrent B-tree algorithm. In: Proc. fall joint computer conference, pp 380-389"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"Lehman","year":"1981","unstructured":"Lehman P, Yao S (1981) Efficient locking for concurrent operations on B-trees. ACM Trans Database Sys 6:650-670","journal-title":"ACM Trans Database Sys"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Lomet D (1992) MLR: a recovery method for multi-level systems. In: Proc. ACM SIGMOD international conference on management of data, pp 185-194","DOI":"10.1145\/130283.130314"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Lomet D, Salzberg B (1992)) Access method concurrency with recovery. In: Proc. ACM SIGMOD international conference on management of data, pp 351-360","DOI":"10.1145\/130283.130336"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s007780050042","volume":"6","author":"Lomet","year":"1997","unstructured":"Lomet D, Salzberg B (1997) Concurrency and recovery for index trees. VLDB J 6:224-240","journal-title":"VLDB J"},{"key":"CR18","unstructured":"Mohan C (1989) ARIES\/KVL: a key-value locking method for concurrency control of multi-action transactions operation on B-tree indexes. IBM Research Report RJ7008, IBM Almaden Research Center"},{"key":"CR19","unstructured":"Mohan C (1990) ARIES\/KVL: a key-value locking method for concurrency control of multi-action transactions operation on B-tree indexes. In: Proc. 16th VLDB conference, pp 392-405"},{"key":"CR20","unstructured":"Mohan C (1996) Concurrency control and recovery methods for B $\\pm$ tree indexes: ARIES\/KVL and ARIES\/IM. In: Kumar V (ed) Performance of concurrency control mechanisms in centralized database systems. Prentice-Hall, Upper Saddle River NJ, pp 248-306"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Mohan C, Levine F (1992) ARIES\/IM: an efficient and high concurrency index management method using write-ahead logging. In: Proc. ACM SIGMOD international conference on management of data, pp 371-380","DOI":"10.1145\/130283.130338"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/128765.128770","volume":"17","author":"Mohan","year":"1992","unstructured":"Mohan C, Haderle D, Lindsay B, Pirahesh H, Schwarz P (1992) ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans Database Sys 17:94-162","journal-title":"ACM Trans Database Sys"},{"key":"CR23","unstructured":"Mond Y, Raz Y (1985) Concurrency control in B $\\pm $ tree databases using preparatory operations. In: Proc. 11th VLDB conference, pp 331-334"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Nurmi O, Soisalon-Soininen E, Wood D (1987) Concurrency control in database structures with relaxed balance. In: Proc. ACM international conference on principles of database systems, pp 170-176","DOI":"10.1145\/28659.28677"},{"key":"CR25","unstructured":"Papadimitriou C (1986) The theory of database concurrency control. Computer Science Press, Rockville, MD"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Sagiv","year":"1986","unstructured":"Sagiv Y (1986) Concurrent operations on B*-trees with overtaking. J Comput Sys Sci 33:275-296","journal-title":"J Comput Sys Sci"},{"key":"CR27","unstructured":"Setzer V, Zisman A (1994) New concurrency control algorithms for accessing and compacting B-trees. In: Proc. 20th VLDB conference, pp 238-248"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Srinivasan V, Carey M (1991)) Performance of B $\\pm $ tree concurrency control algorithms. In: Proc. ACM SIGMOD international conference on management of data, pp 416-425","DOI":"10.1145\/119995.115860"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263046","volume":"2","author":"Srinivasan","year":"1993","unstructured":"Srinivasan V, Carey M (1993) Performance of B $\\pm $ tree concurrency control algorithms. VLDB J 2:361-406","journal-title":"VLDB J"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Sullivan M, Olson M (1992) An index implementation supporting fast recovery for the POSTGRES storage system. In: Proc. 8th IEEE data engineering conference, pp 293-300","DOI":"10.1109\/ICDE.1992.213181"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0140-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0140-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0140-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T04:20:17Z","timestamp":1585887617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0140-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0140-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}