RFID不确定数据流中的Top-K查询研究  

Study on Top-K queries of RFID uncertain data streams

作　　者：卢印举[1] 李志超[1] 苏玉[1] 

机构地区：[1]中州大学信息工程学院,河南郑州450044

出　　处：《电子设计工程》2013年第16期21-23,共3页Electronic Design Engineering

基　　金：河南省科技攻关计划项目(2102210247)

摘　　要：在游客游迹跟踪与追溯系统中,产生大量不确定数据,有效的Top-K查询处理是不确定性数据管理中一项重要技术。研究了运用Top-K检索不确定数据的问题,定义了不确定数据流元组的查询语义,提出了一种在记录向量的基础上的不确定数据查询算法,并利用实例演示了查询的过程。该算法按照元组的得分值进行降序排列,概率值最高的前k个元组集合就是Top-K的查询结果,实验结果表明,本文的算法更具高效性和实用性。Massive uncertain data are produced in the system for tourist tracking and tracing during the travel.Efficient processing of Top-K queries has always been a significant technique in the management of uncertain data streams.This paper introduces a novel method by using Top-K queries on uncertain data streams,and a new semantics of Top-K queries for uncertain data is defined.Based on the vector,an efficient algorithm for Top-K queries on uncertain data streams is designed and realized,using a example to illustrate the process of the algorithm.The algorithm in this paper sorts the tuples in a descending order of score values and selects the k tuples with the highest probabilities from the sets of different numbers of the tuples.The extensive experiments demonstrate that this algorithm is more practical and efficient.

关 键 词：不确定数据 元组 TOP-K查询 可能世界 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]