关键词: 最小最低实体子树, 最小相关实体子树, XML关键字查询, XML数据库, 语义相关性

Abstract: A query algorithm of semantic relativity was proposed in this paper, with regard to many meaningless nodes contained in the present results of XML keywords retrieval. Based on the characteristics of semi-structure and self-description of XML files, the concept of Smallest Lowest Entity Sub-Tree (SLEST), in which only physical connection exists between keywords, was put forward by making full use of semantic correlation between nodes. Based on Smallest Interrelated Entity Sub-Tree (SIEST), an algorithm, in which the result was represented by SLEST and SIEST instead of Smallest Lowest Common Ancestor (SLCA), was proposed to capture the IDREF relation between keywords. The result shows that the algorithm proposed in this paper can increase the precision of XML keyword retrieval.

Key words: Smallest Lowest Entity Sub-Tree (SLEST), Smallest Interrelated Entity Sub-Tree (SIEST), XML keyword query, XML database, semantic relativity