{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:00:55Z","timestamp":1742994055954,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_64","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"477-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Highly Concurrent Locking in Shared Memory Database Systems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Jacobi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e1dric","family":"Lichtenau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"G. Alverson, et al.: The Tera Computer System, Supercomputing, 1990.","DOI":"10.1145\/77726.255132"},{"key":"64_CR2","unstructured":"F. Abolhassan, J. Keller and W.J. Paul:On the Cost-Effectiveness and Realization of the theoretical PRAM Model, SFB-Report 09\/91, March 1991."},{"key":"64_CR3","doi-asserted-by":"crossref","unstructured":"A. Gottlieb, et al.: The NYU Ultracomputer-Designing an MIMD Shared-Memory Parallel Computer, IEEE Trans. on Computers, pp. 175\u2013189, Feb 1983.","DOI":"10.1109\/TC.1983.1676201"},{"key":"64_CR4","unstructured":"J. Gray and A. Reuter: Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993"},{"key":"64_CR5","unstructured":"C. Jacobi: A relational Database System for the SB-PRAM. TPC-B and Concurrency-Control, Master Thesis (german), University of Saarland, 1999."},{"key":"64_CR6","unstructured":"L.D. Molesky and K. Ramamritham: Efficient Locking for Shared Memory Database Systems, University of Massachusetts Technical Report, March 1994."},{"key":"64_CR7","unstructured":"J. Roehrig: Implementing P4 on the SB-PRAM, Master Thesis (german), University of Saarland, 1996."},{"key":"64_CR8","unstructured":"B. Spengler: A relational Database System for the SB-PRAM. Basic Components, Master Thesis (german), University of Saarland, 1997."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:38:20Z","timestamp":1591875500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}