System optimization: Mathematical programming techniques for optimal computer use
ACM '65 Proceedings of the 1965 20th national conference
Some generalized modeling structures for use in design of file organizations.
Some generalized modeling structures for use in design of file organizations.
A clustering approach to the generation of subfiles for the design of a computer data base.
A clustering approach to the generation of subfiles for the design of a computer data base.
Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
Comment on “an optimal evaluation of Boolean expressions in an online query system”
Communications of the ACM
A mathematical modeling approach to the automatic selection of database designs
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A domain based internal schema for relational database machines
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Foundations for multifile design by application partitioning
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Microprocessor Assisted Tuple Access, Decompression and Assembly for Statistical Database Systems
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
A DBMS for large statistical databases
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
| Hi-index | 48.23 |
One of the main objectives in the design of a file system is the reduction of storage and data transfer costs. This paper presents a model in which several requests access the file system, and each request requires information from one or more variable length data-items. The probabilities of access and the distribution of each data-item's length are assumed to be known, and to be mutually independent. The file system uses one or more storage devices, and each record may be partitioned into subrecords that are stored on different devices. One of the subrecords is designated as the primary record; when a request for a record is made, the primary record is first accessed, and other sub-records are accessed only if the pertinent information is not stored in the primary record. The model that is presented in this paper, both as a nonlinear programming model and a mixed integer programming model, is a very general one; several types of file systems may be derived from it by an appropriate selection of its parameters. This model has already been used in the optimization of library routines' storage at a large scale operating system.