Abstract: K-anonymity is a primary method for guaranteeing the security of views，it can provide privacy protection and prevent information disclosure induced by joining attack.In practical application，it is usual that the data owner will publish multiple views at the same time，so，how to make the whole view set satisfy k-anonymity constraint become the most imperative problems in the research of k-anonymity.Previous researches about k-anonymity have concentrated on k-anonymization algorithm for single view，but these algorithms can not be adopted by views directly.At first，the method how to make views achieving k-anonymity constraint is analyzed under several cases，such as generalizing view separately，preserving dada consistency，minimal generalization.Then，based on the analysis under the several cases，the k-anonymization algorithms for views，such as independent generalization，association generalization，attribute generalization，are proposed respectively.The experiment results show that each k-anonymization algorithm for view set can make view set satisfy k-anonymity constraint effectively.So，they can guarantee the security of the views effectively in the process of publishing views.