Abstract
$\alpha$-Acyclicity is an important notion in database theory. The $\alpha$-arboricity of a hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs that partition the edge set of H. The $\alpha$-arboricity of the complete 3-uniform hypergraph is determined completely.