A MATHEMATICAL PROGRAMMING APPROACH TO THE SELECTION OF ACCESS PATHS FOR LARGE MULTIUSER DATA BASES
暂无分享,去创建一个
[1] S. Bing Yao. An attribute based model for database access cost analysis , 1977, TODS.
[2] R. Gerritsen. A preliminary system for the design of DBTG data structures , 1975, CACM.
[3] P. Bruce Berra,et al. Minimum cost selection of secondary indexes for formatted files , 1977, TODS.
[4] Jeffrey A. Hoffer. Database design practices for inverted files , 1980, Inf. Manag..
[5] Dennis G. Severance,et al. Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.
[6] Dennis G. Severance,et al. A practitioner's guide to addressing algorithms , 1976, CACM.
[7] Mario Schkolnick,et al. A clustering algorithm for hierarchical structures , 1977, TODS.
[8] Dennis G. Severance,et al. Frame memory: a storage architecture to support rapid design and implementation of efficient databases , 1981, TODS.
[9] Toby J. Teorey,et al. The Logical Record Access Approach to Database Design , 1980, CSUR.
[10] Salvatore T. March,et al. Techniques for Structuring Database Records , 1983, CSUR.
[11] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[12] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[13] Alfonso F. Cardenas,et al. Doubly-Chained Tree Data Base Organisation-Analysis and Design Strategies , 1977, Comput. J..
[14] Alfonso F. Cardenas. Analysis and performance of inverted data base structures , 1975, CACM.
[15] J. Rockart. Chief executives define their own data needs. , 1979, Harvard business review.
[16] Dennis G. Severance,et al. A Practical Approach to Selecting Record Access Paths , 1977, CSUR.
[17] Dennis G. Severance,et al. The determination of efficient record segmentations and blocking factors for shared data files , 1977, TODS.
[18] Franz Edelman,et al. The Management of Information Resources - A Challenge for American Business , 1981, MIS Q..