Abstract
In this paper, we consider the complexity of two multi-attribute file design problems. We shall first show that the general problem of designing a multi-attribute file system which is optimal with respect to partial match queries is an NP-hard problem. We shall also show that the Cartesian product file design problem is related to the Composite Number Problem. If the Cartesian product file design problem can be solved by a polynomial algorithm, then the Composite Number Problem can also be solved in polynomial time, which is quite unlikely.
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.
