arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.2835cs.CGcs.DS
收藏

动态陀螺- $k$主导陀螺

Dynamic Top-$k$ Dominating Queries

Andreas Kosmatopoulos, Kostas Tsichlas

摘要:

令$\mathcal{S}$为$n$ 2维点的数据集。top-$k$支配查询旨在报告支配$\mathcal{S}$中最多点的$k$点。点$p$优于点$q$当且仅当$p$的所有坐标都小于或等于$q$的坐标,并且至少有一个坐标严格小于点$q$。top- $k$支配查询结合了极大值查询的支配概念和top- $k$查询的排序功能,可以作为多准则决策系统的重要工具。在这项工作中,我们提出了新的算法来回答半动态(只插入)和全动态(插入和删除)顶- $k$主导查询。据我们所知,这是第一个工作对处理(半)动态顶部$k$占主导地位的查询,提供算法的渐近保证,他们的时间和空间成本。

英文摘要:

Let $\mathcal{S}$ be a dataset of $n$ 2-dimensional points. The top-$k$ dominating query aims to report the $k$ points that dominate the most points in $\mathcal{S}$. A point $p$ dominates a point $q$ iff all coordinates of $p$ are smaller than or equal to those of $q$ and at least one of them is strictly smaller. The top-$k$ dominating query combines the dominance concept of maxima queries with the ranking function of top-$k$ queries and can be used as an important tool in multi-criteria decision making systems. In this work, we propose novel algorithms for answering semi-dynamic (insertions only) and fully dynamic (insertions and deletions) top-$k$ dominating queries. To the best of our knowledge, this is the first work towards handling (semi-)dynamic top-$k$ dominating queries that offers algorithms with asymptotic guarantees regarding their time and space cost.

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

↑