Abstract: For temporal scheme with temporal functional dependencies and temporal multivalued dependencies constraints, the usages of multiple time granularities make it more difficult to solve the membership problem. However, the solution of the membership problem is essential to design an available algorithm of scheme decomposition. Thus, in this paper, strong close set of set of temporal types, finite closure of attribution sets, finite dependency base of attribution sets based on a certain temporal type, finite dependency base of attribution sets and special finite dependency base of attribution sets are introduced; the algorithm of finite closure, finite dependency base of attribution sets and special finite dependency base of attribution sets, and the membership problem is given; and the algorithm's termination and correction are proved.