用于文档检索的Top-K颜色匹配
Top-K Color Queries for Document Retrieval
摘要：
在本文中，我们描述了一个新的有效的（实际上是最佳的）数据结构的{ \em顶- $K$颜色问题}。阵列$A$的每个元素被分配具有优先级$p(c)$的颜色$c$。对于查询范围$[a,b]$和值$K$，我们必须报告在$A[a..b]$中出现的所有颜色中具有最高优先级的$K$颜色，按照其优先级的逆序排序。我们表明，这样的查询可以回答在$O(K)$时间使用$O(N\log σ)$位数据结构，其中$N$是数组中的元素数和$σ$是颜色数。因此，我们的数据结构是渐近最优的最坏情况下的查询时间和空间。作为我们的研究结果的直接应用，我们获得了几个文件检索问题的最佳时间解决方案。该文件的方法也可以是独立的利益。
英文摘要：
In this paper we describe a new efficient (in fact optimal) data structure for the {\em top-$K$ color problem}. Each element of an array $A$ is assigned a color $c$ with priority $p(c)$. For a query range $[a,b]$ and a value $K$, we have to report $K$ colors with the highest priorities among all colors that occur in $A[a..b]$, sorted in reverse order by their priorities. We show that such queries can be answered in $O(K)$ time using an $O(N\log σ)$ bits data structure, where $N$ is the number of elements in the array and $σ$ is the number of colors. Thus our data structure is asymptotically optimal with respect to the worst-case query time and space. As an immediate application of our results, we obtain optimal time solutions for several document retrieval problems. The method of the paper could be also of independent interest.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
