Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
