概率XML关键字检索排序算法

A Ranking Algorithm of Keyword Search on Probabilistic XML Data

探讨了针对概率XML文档集中与内容相关的关键字检索结果的排序问题,针对概率XML文档的特征提出了一种新的排序模式.与仅取决于检索结果概率的检索排序算法不同,本文提出的排序算法充分考虑了节点对文档的区分程度、节点描述文档的程度,以及XML文档本身的结构特性,设计了满足以上特征的检索结果排序模型,并针对排序模型提出了新的倒排索引结构.新的排序算法可以快速完成关键字检索,并将最相关的信息提供给用户.模拟数据集实验验证了该方法的有效性.

Discusses the problem of efficiently ranking the search results of keyword related only to content on probabilistic XML data.A newranking model is presented according to the characteristic of probabilistic XML data.Unlike the existing ranking algorithms which only depend on the probabilities of retrieval results,the newranking algorithm proposed fully considered the degrees of nodes discriminating and describing the documents and the characteristic of probabilistic XML data.A ranking model of retrieval results which satisfied the above features is designed and a newinverted index structure for the ranking model is proposed.The newalgorithm can accomplish keyword search quickly,so as to provide the most relevant information to the users.The results of simulation experiment showthat the proposed method is effective.