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

Farshad Fotouhi, Sakti Pramanik. Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. Inf. Process. Lett., 38(5):271-275, 1991.

Abstract

Abstract is missing.