Abstract
A schema is a collection of finite subsets of a set. One can partition the class of all schemas into tree schemas and cyclic schemas. This partitioning has been extensively studied in relational database theory. In this paper we examine the impact of tree schemas on some NP-complete problems. We show that tree schema instances can be efficiently solved (i.e., polynomially) for certain NP-complete problems.
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.
