arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.0222cs.DB
收藏

大型时态数据的排序

Ranking Large Temporal Data

Jeffrey Jestes, Jeff M. Phillips, Feifei Li, Mingwang Tang

摘要:

尽管排序是数据库系统中的一个重要操作(被提升为一等公民),但直到最近才对时态数据进行排序。然而,只有即时top-k查询时态数据进行了研究,其中对象与k最高分数在查询时间实例t被检索。即时top-k定义显然具有局限性(对离群值敏感,难以选择有意义的查询时间t)。一个更灵活和通用的排名操作是基于查询区间内的得分聚合来对对象进行排名,我们称之为时态数据上的聚合top-k查询。例如,返回10/01/2010至10/07/2010期间平均气温最高的前10个气象站;查找2011年2月5日至2月7日期间总成交量最大的前20只股票。这项工作提出了一个全面的研究,这个问题的设计精确和近似的方法(近似质量保证)。对每种方法的构建成本、索引大小、更新成本和查询成本进行了理论分析。在大型真实数据集上的大量实验清楚地表明了我们的方法与基线方法相比的效率,有效性和可扩展性。

英文摘要:

Ranking temporal data has not been studied until recently, even though ranking is an important operator (being promoted as a firstclass citizen) in database systems. However, only the instant top-k queries on temporal data were studied in, where objects with the k highest scores at a query time instance t are to be retrieved. The instant top-k definition clearly comes with limitations (sensitive to outliers, difficult to choose a meaningful query time t). A more flexible and general ranking operation is to rank objects based on the aggregation of their scores in a query interval, which we dub the aggregate top-k query on temporal data. For example, return the top-10 weather stations having the highest average temperature from 10/01/2010 to 10/07/2010; find the top-20 stocks having the largest total transaction volumes from 02/05/2011 to 02/07/2011. This work presents a comprehensive study to this problem by designing both exact and approximate methods (with approximation quality guarantees). We also provide theoretical analysis on the construction cost, the index size, the update and the query costs of each approach. Extensive experiments on large real datasets clearly demonstrate the efficiency, the effectiveness, and the scalability of our methods compared to the baseline methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑