Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In a database the response time to a query can be reduced if certain concurrent operations are provided. In order to maximize the degree of concurrency, data has to be carefully allocated. The complexities of the following two problems are studied in this paper: one is to allocate a database onto a multiple-disk system which maximizes the disk access concurrency; the other one is to allocate a database over a network which minimize the number of nodes being used and a complete parallel searching is possible for a set of queries. Both are shown to be NP-hard (computational intractable) problems.