1. For indexing, semantic tree model is put forward.

2. Lexic analysis constructs query semantic tree according to the semantic unit which lexic analyzer provides.

3. An algorithm for logic function minimization called semantic tree is reported in the paper.

4. This method constructs a semantic tree for 3D models firstly.

5. In this paper, semantic trees that had accession and deletion were established based on How-Net to implement granularity concept matching. The concept semantic tree matching algorithm was presented.

6. One of the key skill set that we see emerging is to understand the semantic tree and be able to use the different tools.

7. In this paper, we present a constitutive form of composite events in Active Database. For implementing and detecting the composite event a method based on the "extended semantic tree"is proposed.

8. A middle formal language(MML) is introduced to describe the semantic tree, and the associated relationship is used to solve the relations of tables and thus complete the transition from MML to SQL.

9. Thus, the problem of service discovery for composite process turns into that of semantic tree matching on the basis of path identification, and the solution is given to it correspondingly.