东北大学学报(自然科学版) ›› 2010, Vol. 31 ›› Issue (1): 23-27.DOI: -

• 论著 • 上一篇    下一篇

Web数据库近似查询结果自动排序方法

孟祥福;马宗民;张霄雁;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-20 修回日期:2013-06-20 出版日期:2010-01-15 发布日期:2013-06-20
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    教育部新世纪优秀人才支持计划项目(NCET-05-0288)

Automated ranking of approximate query results of web database

Meng, Xiang-Fu (1); Ma, Zong-Min (1); Zhang, Xiao-Yan (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-20 Revised:2013-06-20 Online:2010-01-15 Published:2013-06-20
  • Contact: Meng, X.-F.
  • About author:-
  • Supported by:
    -

摘要: 针对Web数据库近似查询产生的多查询结果问题,提出了一种近似查询结果自动排序方法,该方法利用KL距离(Kullback-Leibler distance),PIR(probabilistic information retrieval)模型和查询历史(query history)来构建元组排序打分函数;打分函数根据结果元组中被查询指定的属性值对初始查询的满足度和未被查询指定的属性值与用户偏好的相关度来评估元组的排序分值.实验证明,提出的排序方法能够较好地满足用户需求和偏好,并具有较高执行效率.

关键词: Web数据库, 近似查询, 属性权重, 用户偏好, 排序

Abstract: To solve the problem of over many results obtained from a Web database through an approximate query, an automated ranking method was first proposed for those results, taking advantages of the KL distance, PIR model and query history to formulate a tuple scoring function. According to the satisfiabilities of specified attribute values in result tuple to the initial query and the relevance of unspecified attribute values to users' preference, the scoring function evaluates the scores of ranked tuples. Experimental results demonstrated that the automated ranking method proposed can meet the users' requirements and their preference effectively with high efficiency.

中图分类号: