{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:38Z","timestamp":1725663638237},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535072"},{"type":"electronic","value":"9783540466826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53507-1_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:10:09Z","timestamp":1330207809000},"page":"107-125","source":"Crossref","is-referenced-by-count":3,"title":["Maintaining bounded disorder files in multiprocessor multi-disk environments"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Matsliach","sequence":"first","affiliation":[]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer, \u201cThe Ubiquitous B-tree\u201d, ACM Computing Surveys, Vol 11, No 2, June 1979, pp. 121\u2013137.","journal-title":"ACM Computing Surveys"},{"key":"7_CR2","unstructured":"D. J. DeWitt, H. R. Gerber, G. Graefe, L. M. Heytens, K. B. Kumar, and M. Muralikrishna, \u201cGAMMA: A Performance Dataflow Database Machine\u201d, Proc. of Very Large Data Bases Conf., August 1986, pp. 228\u2013237."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(82)90534-4","volume":"55","author":"B. Eisenbarth","year":"1982","unstructured":"B. Eisenbarth, N. Ziviani, G. H. Gonnet, K. Mehlhorn, and D. Wood, \u201cThe Theory of Fringe Analysis and its Application to 2\u20133 Trees and B-trees\u201d, Information and Control, Vol 55, 1982, pp. 125\u2013174.","journal-title":"Information and Control"},{"issue":"3","key":"7_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, and R. H. Strong, \u201cExtendible Hashing \u2014 a Fast Access Method for Dynamic Files\u201d, ACM Transaction on Database Systems, Vol 4, No 3, September 1979, pp. 315\u2013355.","journal-title":"ACM Transaction on Database Systems"},{"key":"7_CR5","unstructured":"T. Lehman, \u201cDesign and Performance Evaluation of Main Memory Relational Database System\u201d, University of Wisconsin Madison, Computer Science Dep. T.R. #656, August 1986."},{"key":"7_CR6","unstructured":"W. Litwin, \u201cLinear Hashing: a new tool for file and table addressing\u201d, Proc. of Very Large Data Bases Conf., October 1980, pp. 212\u2013223."},{"issue":"1","key":"7_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/12047.12049","volume":"12","author":"D. B. Lomet","year":"1987","unstructured":"D. B. Lomet, \u201cPartial Expansions for File Organizations With an Index\u201d, ACM Transactions on Database Systems, Vol 12, No 1, March 1987, pp. 65\u201384.","journal-title":"ACM Transactions on Database Systems"},{"issue":"4","key":"7_CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/49346.50067","volume":"13","author":"D. B. Lomet","year":"1988","unstructured":"D. B. Lomet, \u201cA Simple Bounded Disorder File Organization with Good Performance\u201d, ACM Transactions on Database Systems, Vol 13, No 4, December 1988, pp. 525\u2013551.","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"G. Matsliach, \u201cPerformance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions\u201d, Technion \u2014 Israel Institute of Technology, Dept. of Computer Science, TR #643, July 1990.","DOI":"10.1016\/0020-0190(90)90043-W"},{"issue":"6","key":"7_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0020-0190(90)90016-Q","volume":"34","author":"G. Matsliach","year":"1990","unstructured":"G. Matsliach, and O. Shmueli, \u201cDistributing a B+-tree in a Loosely Coupled Environment\u201d, Information Processing Letters, Vol 34, No 6, May 1990. pp. 313\u2013321.","journal-title":"Information Processing Letters"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"G. Matsliach, and O. Shmueli, \u201cA Combined Method for Maintaining Indices in Multi-processor Multi-disk Environments\u201d, Technion \u2014 Israel Institute of Technology, Dept. of Computer Science, TR #608, February 1990.","DOI":"10.1007\/3-540-53507-1_73"},{"key":"7_CR12","unstructured":"G. Matsliach, and O. Shmueli, \u201cA General Method For Distributing Search Structures and Reducing Main Memory Consumption\u201d, Technion \u2014 Israel Institute of Technology, Dept. of Computer Science, Center of Intelligent Systems, TR #9004, June 1990."},{"key":"7_CR13","unstructured":"G. Matsliach, and O. Shmueli, \u201cA Framework for Distributing and Parallelizing Secondary Memory Search Structures\u201d, Technion \u2014 Israel Institute of Technology, Dept. of Computer Science, TR #637, June 1990."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"M. V. Ramakrishna, and P. Mulkhopadhyay, \u201cAnalysis of Bounded Disorder File Organization\u201d, Proc. of ACM-PODS Conf., 1988, pp. 117\u2013125.","DOI":"10.1145\/308386.308424"},{"issue":"2","key":"7_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y. Sagiv","year":"1986","unstructured":"Y. Sagiv, \u201cConcurrent Operations on B+-trees with Overtaking\u201d, Journal of Computer and System Sciences, Vol 33, No 2, October 1986, pp. 275\u2013296.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. A. C. Yao","year":"1978","unstructured":"A. A. C. Yao, \u201cOn Random 2\u20133 Trees\u201d, Acta Informatica, Vol 9, No 2, 1978, pp. 159\u2013170.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","ICDT '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53507-1_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:50:34Z","timestamp":1605646234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53507-1_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540535072","9783540466826"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-53507-1_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}