1. A method for finding frequent itemsets using a compressed prefix tree structure that manages information on an indefinite data set composed of transactions generated continuously in an application domain and information on itemsets generated in the transactions of the indefinite data set with a single node in a restricted memory space.