Distributing a database for Parallel Processing is NP-hard.
Hung-Chang DuPublished in: SIGMOD Rec. (1984)
Keyphrases
- parallel processing
- database
- np hard
- distributed processing
- computational power
- processing speed
- databases
- ibm sp
- database management systems
- scheduling problem
- database applications
- parallel architectures
- parallel architecture
- parallel computers
- real time
- parallel execution
- parallel programming
- parallel computation
- relational databases
- database systems
- lower bound
- approximation algorithms
- tree decomposition
- multiple queries
- electronic circuits
- data management