Proposed a novel model to find partial periodic-frequent patterns in a database. Introduced a measure to find partial periodic-frequent patterns in a database. An efficient pruning technique has been proposed to reduce the computational cost. Described a pattern-growth algorithm to find all partial periodic-frequent patterns Experimental results show that our model is efficient.