Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard.

Farshad Fotouhi Sakti Pramanik

Published in: Inf. Process. Lett. (1991)

Keyphrases

np hard
small number
computational complexity
lower bound
genetic algorithm
optimal solution
relational databases
search algorithm
query processing
special case
query optimization
approximation algorithms
join algorithms