{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T21:40:02Z","timestamp":1734558002235,"version":"3.30.2"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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,9]]},"DOI":"10.1007\/bf00288973","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:10:14Z","timestamp":1096909814000},"page":"597-614","source":"Crossref","is-referenced-by-count":4,"title":["Concurrency and Trie Hashing"],"prefix":"10.1007","volume":"26","author":[{"given":"W.","family":"Litwin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Vidyasankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/22952.22954","volume":"12","author":"C.S. Ellis","year":"1987","unstructured":"Ellis, C.S.: Concurrency in Linear Hashing. ACM TODS 12, 195?217 (1987)","journal-title":"ACM TODS"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Ford, R., Calhoun, J.: Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms. Proc. ACM PODS'84, pp. 51?60","DOI":"10.1145\/588011.588020"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Goodman, N., Shasha, D.: Semantically-based Concurrency Control for Search Structures. Proc. ACM PODS'85, pp. 8?19","DOI":"10.1145\/325405.325407"},{"key":"CR4","volume-title":"The Art of Computer Programming. Vol. 3: Sorting and Searching","author":"D.E. Knuth","year":"1974","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol. 3: Sorting and Searching. Reading, Mass.: Addison-Wesley 1974"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","volume":"5","author":"H.T. Kung","year":"1980","unstructured":"Kung, H.T., Lehman, P.L.: Concurrent Manipulation of Binary Search Trees. ACM TODS 5, 354?382 (1980)","journal-title":"ACM TODS"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P.L. Lehman","year":"1981","unstructured":"Lehman, P.L., Yao, S.B.: Efficient Locking for Concurrent Opertions on B-Trees. ACM TODS 6, 650?670 (1981)","journal-title":"ACM TODS"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Litwin, W.: Trie Hashing. Proc. ACM SIGMOD'81, pp. 19?29","DOI":"10.1145\/582318.582322"},{"key":"CR8","volume-title":"Trie Hashing: Further Properties and Performance. Foundations of Data Organization","author":"W. Litwin","year":"1986","unstructured":"Litwin, W.: Trie Hashing: Further Properties and Performance. Foundations of Data Organization. New York: Plenum Press 1986"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Litwin, W., Zegour, D., Levy, G.: Multilevel Trie Hashing. Proc. Extending Database Technology Conference, Venice, 1988","DOI":"10.1007\/3-540-19074-0_60"},{"key":"CR10","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":"CR11","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/322169.322176","volume":"27","author":"A. Silberschatz","year":"1980","unstructured":"Silberschatz, A., Kadem, Z.: Consistency in Hierarchical Database Systems. J. ACM 27, 72?80 (1980)","journal-title":"J. ACM"},{"key":"CR12","volume-title":"Principles of Database Systems","author":"J.D. Ullman","year":"1982","unstructured":"Ullman, J.D.: Principles of Database Systems. Rockville, Md: Computer Science Press 1982"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288973.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288973\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T21:19:02Z","timestamp":1734556742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF00288973"],"URL":"https:\/\/doi.org\/10.1007\/bf00288973","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}