Abstract
In process to implement a database scheme with “good” qualities, at the first step, we often assign to each of the set of entities a number (a code). Making note that almost the complexity of conceptual algorithms is usually, at least, proportional to number of codes of attributes, and to the length of the dependency set, we study methods are so-called “logical codings”. In this paper, we study logical codings on an universal U =<S,F>, in which S is the set of attributes, F is the set of functional dependencies. Those logical codings are to be proven independent to all conceptual algorithms. And at the final, we introduce the logical codings NGH which has low complexity and produces a minimal set of codes.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
