A triple system (X; B) is called to be resolvable (or almost resolvable), if B can be partitioned into parallel classes (or almost parallel classes), where the parallel class (or almost parallel class) is a partition of X (or X \{x} for some x ∈ X ). In this paper, we summarize the present situation about large sets (resp. overlarge sets) of several types of triple systems and give some new results.