Efficient discovery of periodic-frequent patterns in very large databases

•Proposed greedy search technique to find periodic-frequent patterns effectively.•Our technique finds global optimal solution, i.e., periodicity of a pattern.•The best and worst case time complexities are O(1) and O(n), respectively.•A pattern-growth algorithm has been introduced to find periodic-frequent patterns.•Experimental results show that our algorithm out performs current state of- the-art algorithms.