On the selection of efficient record segmentations and backup strategies for large shared databases
ACM Transactions on Database Systems (TODS)
Set query optimization in distributed database systems
ACM Transactions on Database Systems (TODS)
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Consequences of assuming a universal relation
ACM Transactions on Database Systems (TODS)
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Minimum cost selection of secondary indexes for formatted files
ACM Transactions on Database Systems (TODS)
On the Equivalence of Database Models
Journal of the ACM (JACM)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
Managing the Data Base Environment
Managing the Data Base Environment
Principles of Database Systems
Principles of Database Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
| Hi-index | 14.98 |
Given the set of intended transactions, the authors model the problem of choosing the most efficient decomposition of the universal set of attributes. Unlike other models which neglect the logical structure developed in database theory, the model developed incorporates it as part of a mathematical program. This provides a comprehensive and an integrated formulation for the combined logical and physical database design problem. The integrated problem and its epsilon -approximation schemes are shown to be NP-complete. An example shows the benefit of such an approach over more conventional ones.