{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:34Z","timestamp":1742617114928,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512950"},{"type":"electronic","value":"9783540461869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51295-0_132","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:52:39Z","timestamp":1330203159000},"page":"233-240","source":"Crossref","is-referenced-by-count":1,"title":["Concurrency in multidimensional linear hashing"],"prefix":"10.1007","author":[{"given":"M.","family":"Ouksel","sequence":"first","affiliation":[]},{"given":"Jalal","family":"Abdul-Ghaffar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R. and Schkolnick, M., \u201cConcurrency of Operations on B-Trees,\u201d Acta Informatica, vol. 9, pp. 1\u201321, 1977.","journal-title":"Acta Informatica"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Burkhard, Walter A., \u201cInterpolation-Based Index Maintenance,\u201d Proc Second ACM-SIGACT-SIGMOD Symp on Principles of Database System, pp. 76\u201385, 1983.","DOI":"10.1145\/588058.588070"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/22952.22954","volume":"12","author":"C. S. Ellis","year":"1987","unstructured":"Ellis, Carla S., \u201cConcurrency in Linear Hashing,\u201d ACM Transactions on Databases Systems, vol. 12(2), pp. 195\u2013217, June 1987.","journal-title":"ACM Transactions on Databases Systems"},{"issue":"3","key":"18_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","volume":"SE-8","author":"Y. Kwong","year":"1982","unstructured":"Kwong, Yat-Sang and Wood, Derick, \u201cA new Method for Concurrency in B-Trees,\u201d IEEE Transactions on Software Engineering, vol. SE-8(3), pp. 211\u2013222, May 1982.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"18_CR5","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P. L. Lehman","year":"1981","unstructured":"Lehman, Philip L. and Yao, S. Bing, \u201cEfficient Locking for Concurrent Operations on B-Trees,\u201d ACM Transactions on Database Systems, vol. 6(4), pp. 650\u2013670, December 1981.","journal-title":"ACM Transactions on Database Systems"},{"key":"18_CR6","unstructured":"Litwin, Witold, \u201cLinear Hashing: A New Tool for File and Table Addressing,\u201d In Proceedings, 6th Conf on very Large Databases, pp. 212\u2013223, 1980."},{"key":"18_CR7","unstructured":"Onuegbe, E.O. and Du, H.C., \u201cA Locking Scheme for Associative Retrieval,\u201d Unpublished Paper"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Ouksel, M. and Scheuermann, P., \u201cMulti-dimensional Storage Mappings,\u201d Proc Second ACM-SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 90\u2013105, 1983.","DOI":"10.1145\/588058.588071"},{"issue":"4","key":"18_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(88)90058-0","volume":"29","author":"M. Ouksel","year":"1988","unstructured":"Ouksel, M. and Scheuermann, P., \u201cImplicit Data Structures for Linear Hashing Schemes,\u201d Information Processing Letters, vol. 29(4), pp. 183\u2013189, 1988.","journal-title":"Information Processing Letters"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Sagiv, Yehashua, \u201cConcurrent operations on B-trees with overtaking,\u201d Proc of the 4th ACM-SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 28\u201337, 1985.","DOI":"10.1145\/325405.325409"},{"issue":"3","key":"18_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0306-4379(86)90031-1","volume":"11","author":"B. Salzberg","year":"1986","unstructured":"Salzberg, Betty, \u201cConcurrency in Grid Files,\u201d Inform Systems Journal, vol. 11(3), pp. 235\u2013244, 1986.","journal-title":"Inform Systems Journal"},{"issue":"4","key":"18_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","volume":"5","author":"B.S. Samadi","year":"1976","unstructured":"Samadi, B.S., \u201cB-Trees in A System With Multiple Users,\u201d Inform Process Lett, vol. 5(4), pp. 107\u2013112, 1976.","journal-title":"Inform Process Lett"}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51295-0_132.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:52:51Z","timestamp":1742590371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51295-0_132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512950","9783540461869"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51295-0_132","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}