| 概率Top-κ查询的层次索引 |
| |
| 引用本文： | 王晓伟,贾焰.概率Top-κ查询的层次索引[J].小型微型计算机系统,2011,32(11). |
| |
| 作者姓名： | 王晓伟 贾焰 |
| |
| 作者单位： | 国防科技大学计算机学院,长沙,410073 |
| |
| 基金项目： | 国家八六三高技术研究发展计划项目(2011AA010702)资助 |
| |
| 摘 要： | 由于在经济、军事等领域的广泛应用,不确定数据的查询处理技术成为近年来数据库领域的研究热点.概率top-κ查询根据打分函数和概率两个维度来对数据进行排序,因此具有多种查询语义.作为I/O密集型查询,概率top-κ查询需要具备一定通用性的索引技术来提高查询效率.本文从分析概率top-κ查询满足的性质入手,分别基于skyline和支配频率的概念,提出两种层次索引.通过理论分析和实验证明了满足特定性质的概率top-κ查询均可以利用这两种索引来提高I/O效率,其中基于支配频率的索引具有更好的鲁棒性.
|
| 关 键 词： | 不确定数据 概率top-κ查询 层次索引 skyline 支配频率 |
Layered Indices for Probabilistic Top-k Queries |
| |
| WANG Xiao-wei
,
JIA Yan.Layered Indices for Probabilistic Top-k Queries[J].Mini-micro Systems,2011,32(11). |
| |
| Authors: | WANG Xiao-wei JIA Yan |
| |
| Affiliation: | WANG Xiao-wei,JIA Yan(School of Computer,National University of Defense Technology,Changsha 410073,China) |
| |
| Abstract: | Query processing on uncertain data has been a recent hot topic in the database community because of its wide range of applications.Probabilistic top-k queries have multiple query semantics because they rank data according to both scoring function and probability.As a class of I/O intensive queries,the probabilistic top-k queries need general indexing techniques to improve the query efficiency.Starting from the analysis of the nature of probabilistic top-k queries,this paper proposes two layered indices base... |
| |
| Keywords: | uncertain data probabilistic top-k query layered index skyline dominating frequency |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
