Consistent Top-k Queries over Time
Consistent Top-k Queries over Time
复制标题
随着时间的推移一致的 Top-k 查询
DOI：
10.1007/978-3-642-00887-0_5
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
W. Tok
中科院分区：
文献类型：
--
作者：
M. Lee;W. Hsu;Ling Li;W. Tok
Top-k查询已经在快照数据库和数据流中得到了很好的研究。我们观察到，决策者通常对一组随着时间的推移表现出一定程度的一致行为的对象感兴趣。我们引入了一类新的查询称为一致的top-k检索k对象，总是在顶部在指定的时间间隔内的每个时间点。在每个时间点应用top-k方法会导致大量的中间结果和浪费的计算。我们设计了两种方法，基于排名和位图，以解决这些缺点。实验结果表明，本文提出的方法是有效的、可扩展的，一致的top-k查询在真实的应用中是可行的.
Top-k queries have been well-studied in snapshot databases and data streams. We observe that decision-makers are often interested in a set of objects that exhibit a certain degree of consistent behavior over time. We introduce a new class of queries calledconsistent top-kto retrieve k objects that are always amongst the top at every time point over a specified time interval. Applying top-k methods at each time point leads to large intermediate results and wasted computations. We design two methods, rank-based and bitmap, to address these shortcomings. Experiment results indicate that the proposed methods are efficient and scalable, and consistent top-k queries are practical in real world applications.