A Multibranch Search Tree-Based Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data

Algorithm 2

GenBiSectingTree (c, μ).

	Input: A cluster node having a set of documents, c; μ;
	Output: The root of the generated binary clustering tree;
(1)	if then
(2)	Perform the bisecting k-means algorithm on c, and two bisected clusters, cl and cr, are generated, where c = cl cr. Then, set c  lchild = cl and c  rchild = cr, where lchild and rchild are the left and right child cluster nodes of c.
(3)	GenBiSectingTree (c  lchild, μ);
(4)	GenBiSectingTree (c  rchild, μ);
(5)	end if