论文信息 - The hierarchical ordering in multiattribute files

The hierarchical ordering in multiattribute files

Abstract In this paper, we have shown an interesting phenomenon in multiattribute files. If a file becomes significantly more randomized, its performance will deteriorate. Conversely, if a file becomes significantly more structured, its performance will definitely improve. That is, there is a hierarchical structure in multiattribute files.

Chin-Chen Chang | Richard C. T. Lee | M. W. Du

[1] Chin-Chen Chang,et al. Some properties of Cartesian product files , 1980, SIGMOD '80.

[2] Sakti P. Ghosh. Data base organization for data management , 1977 .

[3] Richard C. T. Lee. Clustering Analysis and Its Applications , 1981 .

[4] S. Bing Yao,et al. Multi-dimensional clustering for data base organizations , 1977, Inf. Syst..

[5] James B. Rothnie,et al. Attribute based file organization in a paged memory environment , 1974, CACM.

[6] Jo-Mei Chang,et al. Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method , 1981, IEEE Transactions on Software Engineering.

[7] Azad Bolour. Optimality Properties of Multiple-Key Hashing Functions , 1979, JACM.

[8] Chin-Chen Chang,et al. Performance Analyses of Cartesian Product Files and Random Files , 1984, IEEE Transactions on Software Engineering.

[9] Jon Louis Bentley,et al. Data Structures for Range Searching , 1979, CSUR.

[10] Richard C. T. Lee,et al. Common Properties of Some Multiattribute File Systems , 1979, IEEE Transactions on Software Engineering.

[11] Ronald L. Rivest,et al. Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[12] Chin-Chen Chang,et al. Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries , 1982, IEEE Transactions on Software Engineering.

[13] Alfred V. Aho,et al. Optimal partial-match retrieval when fields are independently specified , 1979, ACM Trans. Database Syst..