Abstract
We propose a class of database schemes called connection-trap-free schemes that allows users to retrieve sound and complete information easily and efficiently from the database. We argue that with this class of database schemes, the connection trap problem can be avoided. We present some fundamental properties of this class of schemes. We then characterize the class of independent and connection-trap-free schemes when an embedded cover of functional dependencies is assumed.
Sign-in/Register to access full text options 
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.
