Performance analysis of the disk modulo allocation method for concurrent accessing on multiple disk systems

References

• Aho , A. V. and Ullman , J. D. 1979 . “Optimal Partial‐Match Retrieval When Fields Are Independently Specified,” . ACM Trans. Database Syst. , 4 ( 2 ) : 168 – 179 .
   Google Scholar
• Bentley , J. L. and Friedman , J. H. 1979 . “Data Structures for Range Searching,” . Comput. Surveys , 11 ( 4 ) : 397 – 409 .
   Web of Science ®Google Scholar
• Bolour , A. 1979 . “Optimality Properties of Multiple Key Hashing Functions,” . J. ACM , 26 ( 2 ) : 196 – 210 .
   Google Scholar
• Chang , C.C. , Du , M.W. and Lee , R. C. T. 1984 . “Performance Analyses of Cartesian Product Files and Random Files,” . IEEE Trans. Software Eng. , SE‐10 ( 1 ) : 88 – 99 .
   Google Scholar
• Chang , J.M. and Fu , K.S. 1981 . “Extended K‐d Tree Database Organization: A Dynamic Multi‐Attribute Clustering Method,” . IEEE Trans. Software Eng. , SE‐7 ( 3 ) : 284 – 290 .
   Google Scholar
• Chang , C.C. , Lee , R.C.T. and Du , H.C. “Some Properties of Cartesian Product Files,” . Proc. ACM‐SIGMOD 1980 Conf. Santa Monica, Calif.. pp. 157 – 168 .
   Google Scholar
• Chang , C.C. , Lee , R.C.T. and Du , M.W. 1982 . “Symbolic Gray Code as a Perfect Multi‐Attribute Hashing Scheme for Partial Match Queries,” . IEEE Trans. Software Eng. , SE‐8 ( 3 ) : 235 – 249 .
   Google Scholar
• Chang , C. C. and Su , D. H. “Some Properties of Multi‐Attribute File System Based Upon Multiple Key Hashing Functions,” . Proc. 21‐st Annu. Allerton Conf. Commun. Control Comput. Urbana, Illinois. pp. 675 – 682 .
   Google Scholar
• Chang , C.C. and Su , D.H. “Application of a Heuristic Algorithm to Design Multiple Key Hashing Functions,” . Proc. NCS 1983 Conf. Hsinchu, Taiwan. pp. 218 – 231 .
   Google Scholar
• Chang , C.C. and Su , D.H. 1984 . “Performance Analyses of Multi‐Attribute Files Based Upon Multiple Key Hashing Functions and Haphazard Files,” , Taichung, Taiwan, , R. O. C. : Tech. Report, Dep. of Appl. Math., Natl. Chung Hsing Univ. .
   Google Scholar
• Ghosh , S. P. 1977 . Data Base Organization for Data Management , 212 – 268 . New York, N. Y. : Academic Press .
   Google Scholar
• Jakobsson , M. 1980 . “Reducing Block Accesses in Inverted Files by Partial Clustering,” . Inform. Syst. , 5 ( 1 ) : 1 – 5 .
   Google Scholar
• Lee , R.C.T. 1981 . “Clustering Analysis and Its Applications,” . In Adv. Inform. Syst. Sci. , Edited by: Tou , J.T. 169 – 287 . New York, N. Y. : Plenum Press .
   Google Scholar
• Lee , R.C.T. and Tseng , S.H. 1979 . “Multi‐Key Sorting,” . Policy Anal. Inform. Syst. , 3 ( 2 ) : 1 – 20 .
   Google Scholar
• Lin , W.C. , Lee , R.C.T. and Du , H.C. 1979 . “Common Properties of Some Multi‐Attribute File Systems,” . IEEE Trans. Software Eng. , SE‐5 ( 2 ) : 160 – 174 .
   Google Scholar
• Liou , J. H. and Yao , S. B. 1977 . “Multi‐Dimensional Clustering for Data Base Organizations,” . Inform. Syst. , 2 : 187 – 198 .
   Google Scholar
• Rivest , R.L. 1976 . “Partial‐Match Retrieval Algorithms,” . SIAM J. Comput. , 14 ( 1 ) : 19 – 50 .
   Google Scholar
• Rothnie , J.B. and Lozano , T. 1974 . “Attribute Based File Organization in a Paged Memory Environment,” . Commun. ACM , 17 ( 2 ) : 63 – 69 .
   Google Scholar
• Du , H.C. and Sobolewski , J.S. 1982 . “Disk Allocation for Cartesian Product Files on Multiple Disk Systems,” . ACM Trans. Database Syst. , 7 : 82 – 101 .
   Google Scholar
• Liu , C. L. 1968 . Introduction to Combinatorial Mathematics , 24 – 57 . New York, N. Y. : McGraw‐Hill .
   Google Scholar