{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T14:52:02Z","timestamp":1649170322335},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1007\/bf01934086","type":"journal-article","created":{"date-parts":[[2005,7,30]],"date-time":"2005-07-30T20:16:11Z","timestamp":1122754571000},"page":"205-214","source":"Crossref","is-referenced-by-count":8,"title":["Application of principal component analysis to multi-disk concurrent accessing"],"prefix":"10.1007","volume":"28","author":[{"given":"C. C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01934086_CR1","first-page":"262","volume":"24","author":"M. Y. Chan","year":"1984","unstructured":"M. Y. Chan,Multidisk file design: An analysis of folding buckets to disks, BIT, Vol. 24, 1984, pp. 262\u2013268.","journal-title":"BIT"},{"key":"BF01934086_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(85)90077-8","volume":"20","author":"M. Y. Chan","year":"1985","unstructured":"M. Y. Chan,A note on redundant disk modulo allocation, Information Processing Letters, Vol. 20, April 1985, pp. 121\u2013123.","journal-title":"Information Processing Letters"},{"key":"BF01934086_CR3","unstructured":"C. C. Chang and C. Y. Chen,Lower bounds of using disk modulo allocation method to allocate cartesian product files in a two-disk system, Proc. ICS 1986 Conference, Tainan, Taiwan, Dec. 1986, pp. 770\u2013774."},{"key":"BF01934086_CR4","unstructured":"C. C. Chang and C. Y. Chen,Performance analysis of the generalized disk modulo allocation method for multiple key hashing files on multi-disk systems, to appear in the Computer Journal, United Kingdom."},{"key":"BF01934086_CR5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/BF01933725","volume":"27","author":"C. C. Chang","year":"1987","unstructured":"C. C. Chang and C. Y. Chen,Performance of two-disk partition data allocations, BIT, Vol. 27, 1987, pp. 306\u2013314.","journal-title":"BIT"},{"key":"BF01934086_CR6","unstructured":"C. C. Chang, M. D. Hsiao, and C. H. Lin,Algorithms to allocate a file for concurrent disk accessing, Proceedings of the 6th Advanced Database System Symposium, Tokyo, Japan, August 1986, pp. 201\u2013205."},{"key":"BF01934086_CR7","unstructured":"C. C. Chang and L. S. Liang,On strict optimality property of allocating binary Cartesian product files on multiple disk systems, Proceedings of the International Conference on Foundation of Data Organization, Kyoto, Japan, May 1985, pp. 104\u2013112."},{"key":"BF01934086_CR8","unstructured":"C. C. Chang and Y. L. Lu,The complexity of multi-disk data allocation problem, Proc. NCS 1985 Conference, Kaoshung, Taiwan, Dec. 1985, pp. 468\u2013471."},{"key":"BF01934086_CR9","doi-asserted-by":"crossref","unstructured":"C. C. Chang and J. J. Shen,tPerformance analysis of the disk modulo allocation method for concurrent accessing on multiple disk systems, Journal of the Chinese Institute of Engineers, Vol. 8, No. 3, pp. 271\u2013283.","DOI":"10.1080\/02533839.1985.9676831"},{"key":"BF01934086_CR10","unstructured":"C. C. Chang and J. J. Shen,Consecutive retrieval organization as a file allocation scheme on multiple disk systems, the Proceedings of the International Conference on Foundations of Data Organization, Kyoto, Japan, May 1985, pp. 74\u201380."},{"key":"BF01934086_CR11","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TIT.1967.1054021","volume":"IT-13","author":"Y. T. Chien","year":"1967","unstructured":"Y. T. Chien and K. S. Fu,On the generalized Karhunen-Loeve expansion, IEEE Transactions on Information Theory, Vol. IT-13, 1967, pp. 518\u2013520.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF01934086_CR12","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01933739","volume":"26","author":"H. C. Du","year":"1986","unstructured":"H. C. Du,Disk allocation methods for binary Cartesian product files, BIT, Vol. 26, 1986, pp. 138\u2013147.","journal-title":"BIT"},{"key":"BF01934086_CR13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/319682.319698","volume":"7","author":"H. C. Du","year":"1982","unstructured":"H. C. Du and J. S. Sobolewski,Disk allocation for Cartesian product files on multiple disk systems, ACM Trans. Database Systems, Vol. 7, March 1982, pp. 82\u2013101.","journal-title":"ACM Trans. Database Systems"},{"key":"BF01934086_CR14","unstructured":"M. T. Fang, R. C. T. Lee, and C. C. Chang,The idea of de-clustering and its applications, 12th International Conference on Very Large Data Bases, Kyoto, Japan, August 1986, pp. 181\u2013188."},{"key":"BF01934086_CR15","volume-title":"Sequential Methods in Pattern Recognition and Machine Learning","author":"K. S. Fu","year":"1968","unstructured":"K. S. Fu,Sequential Methods in Pattern Recognition and Machine Learning, Academic Press, Reading, New York, 1968."},{"key":"BF01934086_CR16","volume-title":"Data Base Organization for Data Management","author":"S. P. Ghosh","year":"1977","unstructured":"S. P. Ghosh,Data Base Organization for Data Management, Academic Press, Reading, New York, 1977."},{"issue":"3","key":"BF01934086_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/TSE.1976.225946","volume":"SE-2","author":"R. C. T. Lee","year":"1976","unstructured":"R. C. T. Lee, Y. H. Chin, and S. C. Chang,Application of principal component analysis to multikey searching, IEEE Transactions on Software Engineering, Vol. SE-2, No. 3, September 1976, pp. 185\u2013193.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"8","key":"BF01934086_CR18","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TSE.1986.6312983","volume":"SE-12","author":"T. S. Yuen","year":"1986","unstructured":"T. S. Yuen and H. C. Du,Dynamic file structure for partial match retrieval based on overflow bucket sharing, IEEE Transactions on Software Engineering, Vol. SE-12, No. 8, August 1986, pp. 801\u2013810.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934086\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:09:57Z","timestamp":1557450597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["BF01934086"],"URL":"https:\/\/doi.org\/10.1007\/bf01934086","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}