{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:59:44Z","timestamp":1648709984059},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/0164-1212(95)00102-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:47:59Z","timestamp":1027586879000},"page":"199-207","source":"Crossref","is-referenced-by-count":1,"title":["Redundant MKH files design among multiple disks for concurrent partial match retrieval"],"prefix":"10.1016","volume":"35","author":[{"given":"C.Y.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.F.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_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":"Vol. 4","author":"Aho","year":"1979","journal-title":"ACM Trans. on Database Systems"},{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_BIB2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/322123.322126","article-title":"Optimality Properties of Multiple Key Hashing Functions","volume":"Vol. 26","author":"Bolour","year":"1979","journal-title":"Journal Assoc. Computing"},{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_BIB3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/320071.320079","article-title":"Partial Match Hash Coding: Benefits of Redundancy","volume":"Vol. 4","author":"Burkhard","year":"1979","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0164-1212(95)00102-6_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":"Vol. 24","author":"Chan","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0164-1212(95)00102-6_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(85)90077-8","article-title":"A Note on Redundant Disk Allocation","volume":"Vol. 20","author":"Chan","year":"1985","journal-title":"IPL"},{"key":"10.1016\/0164-1212(95)00102-6_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":"Vol. 34","author":"Chang","year":"1984","journal-title":"Information Sciences"},{"key":"10.1016\/0164-1212(95)00102-6_BIB7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01934086","article-title":"Application of Principal Component Analysis to Multidisk Concurrent Accessing","volume":"Vol. 28","author":"Chang","year":"1988","journal-title":"BIT"},{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_BIB8","first-page":"177","article-title":"Gray Code as a Declustering Scheme for Concurrent Disk Retrieval","volume":"Vol. 13","author":"Chang","year":"1987","journal-title":"Information Science and Engineering"},{"issue":"No. 3","key":"10.1016\/0164-1212(95)00102-6_BIB9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/comjnl\/35.3.299","article-title":"Symbolic Gray Code as a Data Allocation Scheme for Two-disk Systems","volume":"Vol. 35","author":"Chang","year":"1992","journal-title":"The Computer Journal"},{"issue":"No. 1","key":"10.1016\/0164-1212(95)00102-6_BIB10","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/TSE.1984.5010203","article-title":"Performance Analysis of Cartesian Product Files and Random Files","volume":"Vol. SE-10","author":"Chang","year":"1984","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/0164-1212(95)00102-6_BIB11","series-title":"Proceedings ACM-SIGMOD 1980 Conference","first-page":"157","article-title":"Some Properties of Cartesian Product Files","author":"Chang","year":"1980"},{"key":"10.1016\/0164-1212(95)00102-6_BIB12","series-title":"Proceedings International Conference Foundation of Data Organization","first-page":"113","article-title":"On the Complexity of File Allocation Problem","author":"Chang","year":"1985"},{"key":"10.1016\/0164-1212(95)00102-6_BIB13","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/BF01933172","article-title":"Optimality Criteria of the Disk Modulo Allocation Method for Cartesian Product Files","volume":"Vol. 31","author":"Chen","year":"1991","journal-title":"BIT"},{"key":"10.1016\/0164-1212(95)00102-6_BIB14","article-title":"Optimal Bucket Allocation Design of K-ary MKH Files for Concurrent Partial Match Retrieval","author":"Chen","year":"1994"},{"key":"10.1016\/0164-1212(95)00102-6_BIB15","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01933739","article-title":"Disk Allocation Methods for Binary Cartesian Product Files","volume":"Vol. 26","author":"Du","year":"1986","journal-title":"BIT"},{"issue":"No. 1","key":"10.1016\/0164-1212(95)00102-6_BIB16","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":"Vol. 7","author":"Du","year":"1982","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0164-1212(95)00102-6_BIB17","doi-asserted-by":"crossref","unstructured":"Kim, M. H., and Pramanik, S., Optimal File Distribution for Partial Match Retrieval, in Proceedings ACM-SIGMOD 1988 Conference, Chicago, Illinois; New York, New York, pp. 173\u2013182.","DOI":"10.1145\/50202.50221"},{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_BIB18","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/TSE.1979.234172","article-title":"Common Properties of Some Multi-Attribute File Systems","volume":"Vol. 1","author":"Lin","year":"1979","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/0164-1212(95)00102-6_BIB19","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/BF01931657","article-title":"Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval","volume":"Vol. 30","author":"Ramamohanarao","year":"1990","journal-title":"BIT"},{"issue":"No. 2","key":"10.1016\/0164-1212(95)00102-6_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":"Vol. 17","author":"Rothnie","year":"1974","journal-title":"Communication ACM"},{"issue":"No. 9","key":"10.1016\/0164-1212(95)00102-6_BIB21","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/TSE.1987.233524","article-title":"Performance Analysis of Disk Allocation Method for Cartesian Product Files","volume":"Vol. SE-13","author":"Sung","year":"1987","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"No. 1","key":"10.1016\/0164-1212(95)00102-6_BIB22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0306-4379(85)90005-5","article-title":"On the Complexity of Some Multiattribute File Design Problems","volume":"Vol. 10","author":"Tang","year":"1985","journal-title":"Information Systems"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121295001026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121295001026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T02:26:23Z","timestamp":1556591183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0164121295001026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0164121295001026"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(95)00102-6","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}