计算机科学与探索2011，Vol.5Issue(9)：781-790,10.DOI:10.3778/j.issn.1673-9418.2011.09.002
不确定数据库上的top-k关键字查询
Top-k Keyword Query on Uncertain Database
摘要
Abstract
The problems of keyword search on relational databases and uncertain data management have been considered extensively, however addressed in isolation in the past. This paper introduces a novel method that combines IR-style keyword query with uncertain relational databases, and defines an uncertain model and its query semantics. The paper also shows a top-it algorithm to perform keyword search query on the attribute level, and return k query results which have maximum rank scores. Rank score of a query result is well-defined, depending on its correlation with query keywords and its possibility under the possible world. An optimized algorithm is introduced to reduce the complexity of the top-it query. The experimental results demonstrate the practicality and efficiency of these methods.关键词
关键字检索/不确定/top-k/可能世界Key words
keyword search/ uncertainty/ top-k/ possible world分类
信息技术与安全科学引用本文复制引用
张徵,杨卫东,朱皓..不确定数据库上的top-k关键字查询[J].计算机科学与探索,2011,5(9):781-790,10.基金项目
The National High-Tech Research and Development Plan of China under Grant No.2008AA121705(国家高技术研究发展计划(863)) （国家高技术研究发展计划(863）
the Key Fundamental Research Project of Shanghai under Grant No.08JC1402500(上海市重点基础研究项目) （上海市重点基础研究项目）
the Science and Technology Innovation Project of Shanghai under Grant No.Xiao-34-1(上海市科技创新专项). （上海市科技创新专项）
