As for case searching algorithms, this paper presents an improved K-D tree algorithm based on the characteristics of XML documents and K-D tree algorithms and implements the algorithm.

The thesis analyzes the advantages and drawbacks of the two kinds of algorithms and proposes a mixture model which introduces the feature driven methods (K-D Forest) into vocabulary tree.