Journal of University of Science and Technology of China ›› 2019, Vol. 49 ›› Issue (2): 93-99.DOI: 10.3969/j.issn.0253-2778.2019.02.002

Previous Articles     Next Articles

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

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