{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:35:35Z","timestamp":1649216135615},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0020-0255(91)90006-g","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"69-76","source":"Crossref","is-referenced-by-count":2,"title":["A note on allocating k-ary multiple key hashing files among multiple disks"],"prefix":"10.1016","volume":"55","author":[{"given":"C.C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.Y.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/320071.320074","article-title":"Optimal partial-match retrieval when fields are independently specified","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/320455.320469","article-title":"Hashing and algorithms for partial match retrieval","volume":"1","author":"Burkhard","year":"1976","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/320071.320079","article-title":"Partial match hashing coding: Benefits of redundancy","volume":"4","author":"Burkhard","year":"1979","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0020-0255(91)90006-G_BIB4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/BF02136024","article-title":"Multidisk file design: An analysis of folding buckets to disks","volume":"24","author":"Chan","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0020-0255(91)90006-G_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(85)90077-8","article-title":"A note on redundant disk modulo allocation","volume":"20","author":"Chan","year":"1985","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0255(91)90006-G_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(84)90049-5","article-title":"Optimal information retrieval when queries are not random","volume":"34","author":"Chang","year":"1984","journal-title":"Information Sciences"},{"key":"10.1016\/0020-0255(91)90006-G_BIB7","series-title":"Proceedings of the International Computer Symposium","first-page":"770","article-title":"Lower bounds of using disk modulo allocation method to allocate cartesian product files in a two-disk system","author":"Chang","year":"1986"},{"issue":"6","key":"10.1016\/0020-0255(91)90006-G_BIB8","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1093\/comjnl\/30.6.535","article-title":"Performance analysis of the generalized disk modulo allocation method for multiple key hashing files on multi-disk systems","volume":"30","author":"Chang","year":"1987","journal-title":"Computer Journal"},{"issue":"1","key":"10.1016\/0020-0255(91)90006-G_BIB9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/TSE.1984.5010203","article-title":"Performance analyses of Cartesian product files and random files","volume":"SE-10","author":"Chang","year":"1984","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0020-0255(91)90006-G_BIB10","doi-asserted-by":"crossref","unstructured":"C. C. Chang, R. C. T. Lee, and H. C. Du, Some properties of Cartesian product files, in Proceedings of the ACM-SIGMOD 1980 Conference, pp. 157\u2013168.","DOI":"10.1145\/582250.582276"},{"issue":"3","key":"10.1016\/0020-0255(91)90006-G_BIB11","first-page":"235","article-title":"Symbolic gray code as a perfect multi-attribute hashing scheme for partial match queries","volume":"SE-8","author":"Chang","year":"1982","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/0020-0255(91)90006-G_BIB12","series-title":"Proceedings of the International Conference on Foundations of Data Organization","first-page":"113","article-title":"On the complexity of the file allocation problem","author":"Chang","year":"1985"},{"issue":"1","key":"10.1016\/0020-0255(91)90006-G_BIB13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1080\/02533839.1987.9676947","article-title":"Performance analyses of multi-attribute files based upon multiple key hashing functions and haphazard files","volume":"10","author":"Chang","year":"1987","journal-title":"J. Chinese Inst. Eng."},{"key":"10.1016\/0020-0255(91)90006-G_BIB14","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01933739","article-title":"Disk allocation methods for binary Cartesian product files","volume":"26","author":"Du","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0020-0255(91)90006-G_BIB15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/319682.319698","article-title":"Disk allocation for Cartesian product files on multiple disk systems","volume":"7","author":"Du","year":"1982","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB16","first-page":"1","article-title":"Multi-key sorting","volume":"3","author":"Lee","year":"1979","journal-title":"Policy Analysis and Information Systems"},{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB17","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/TSE.1979.234172","article-title":"Common properties of some multi-attribute file systems","volume":"SE-5","author":"Lin","year":"1979","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0020-0255(91)90006-G_BIB18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0306-4379(77)90007-2","article-title":"Multi-dimensional clustering for data base organizations","volume":"2","author":"Liou","year":"1977","journal-title":"Information Systems"},{"issue":"1","key":"10.1016\/0020-0255(91)90006-G_BIB19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","article-title":"Partial-match retrieval algorithms","volume":"14","author":"Rivest","year":"1976","journal-title":"SIAM J. Computing"},{"issue":"2","key":"10.1016\/0020-0255(91)90006-G_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/360827.360831","article-title":"Attribute based file organization in a paged memory environment","volume":"17","author":"Rothnie","year":"1974","journal-title":"Communications of the Association for Computing Machinery"},{"issue":"1","key":"10.1016\/0020-0255(91)90006-G_BIB21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0306-4379(85)90005-5","article-title":"On the complexity of some multi-attribute file design problems","volume":"10","author":"Tang","year":"1984","journal-title":"Information Systems"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190006G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190006G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:23:51Z","timestamp":1552915431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559190006G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002002559190006G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(91)90006-g","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}