Year-end Sale % OFF 
Abstract
AbstractIn most studies of the optimum allocation problem of the data file in the distributed database system, access to individual files is considered independent, ignoring the relation among files. This assumption may not be appropriate in actual cases. In this paper, the expression for the query cost is simplified as long as the essential aspect of the problem is maintained. A formulation is made based on a clear distinction between the part of the file which can be considered as independent in the individual access, and the part which is not. Then for each formulation, the computational complexity in the optimum file allocation is discussed. It is shown that the problem for the former can be answered in a polynomial time, while the latter is NP‐hard.
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.
