Frequent Pattern Mining (FPM) plays an essential role in many data analytic tasks. In literature, many techniques have been proposed to discover interesting patterns. However, the complexity in terms of computational time is a major concern. In this paper, we have proposed a novel FPM algorithm using boolean matrix. Here the transactional dataset is transformed into a boolean matrix, that further decomposed vertically into multiple loads. Our proposed algorithm improves efficiency in terms of computational time and further it may be used in a distributed environment to deal with huge dataset.