中国科学技术大学学报 ›› 2019, Vol. 49 ›› Issue (2): 93-99.DOI: 10.3969/j.issn.0253-2778.2019.02.002

• 原创论文 • 上一篇    下一篇

基于CP-net偏好的关系数据库的Top-k实现

栾艳红   

  1. 烟台大学计算机与控制工程学院,山东烟台 264005
  • 收稿日期:2018-05-24 修回日期:2018-09-18 出版日期:2019-02-28 发布日期:2019-02-28
  • 通讯作者: 孙雪姣
  • 作者简介:栾艳红,女,1994年生,硕士生. 研究方向:数据库. E-mail: 1595247160@qq.com
  • 基金资助:
    山东省高等学校科技计划项目(J14LN23,J15LN09);山东省自然科学基金(ZR2014FL009,ZR2015PF010);国家自然科学基金(61572419,61572418)资助.

Top-k query of relational database based on CP-net

LUAN Yanhong   

  1. School of Computer and Control Engineering ,Yantai University ,Yantai 264005,china
  • Received:2018-05-24 Revised:2018-09-18 Online:2019-02-28 Published:2019-02-28

摘要: CP-net是一种简单而又直观的图形化的偏好表示工具,能够被用来描述在那些相对严密的、直观的、结构化的条件偏好信息中隐含的定性偏好关系,尤其适合信息不完整情况下的属性间具有依赖关系的多属性定性偏好决策.Top-k查询旨在检索出满足用户需求的前k个结果,从而提高检索效率,为此致力于实现具有CP-net偏好的关系数据库的Top-k查询.首先,CP-net被诱导成多个表来表示和存储;其次,将传统的帕累托复合拓展到模型中,以此保持偏好之间的严格的偏序关系;最后,基于“格”框架(Lattice)理论,实现了基于CP-net偏好的关系数据库的Top-k查询.

关键词: 条件偏好网, 条件偏好表, 关系数据库, 偏好查询, 偏好复合

Abstract: CP-net is a simple and intuitive graphical preference representation tool that can be used to describe the qualitative preference relationships implied in relatively tight, intuitive, structured conditional preference information. Full-featured qualitative decision-making with multiple dependencies between attributes in complete cases. Top-k queries are designed to retrieve the top k results that meet user requirements, thereby improving search efficiency. Aiming at implement Top-k queries with relational databases that have CP-net preferences. First, CP-net is induced into multiple tables for representation and storage, Then, the traditional Pareto composition is extended into the model so as to maintain a strict partial order relationship between preferences. Finally, based on “Lattice” theory, the Top-k query of relational database based on CP-net preference has been implemented.

Key words: CP-net, CPT, relational database, preference queries, preference composition