Top-k文档检索的最优时空索引
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
摘要:
假设$\D = $ $ \{d_1,d_2,...d_D\}$是一组给定的$D$字符串文档,其总长度为$n$,我们的任务是索引$\D$,使得可以有效地检索与长度为$p$的在线查询模式$P$最相关的$k$文档。我们提出了一个索引的大小$|CSA|+n\log D(2+o(1))$位和$O(t_{s}(p)+k\log\log n+poly\log\log n)$查询时间的基本相关性度量\emph{term-frequency},其中$|CSA|$是一个压缩的全文索引的$\D$的大小(位),与$O(t_s(p))$时间搜索模式的长度$p$。我们进一步将空间减少到$|CSA|+n\log D(1+o(1))$位,但是查询时间将是$O(t_s(p)+k(\log σ\log\log n)^{1+ε}+poly\log\log n)$,其中$σ$是字母表大小,而$ε>0$是任意常数。
英文摘要:
Let $\D = $$ \{d_1,d_2,...d_D\}$ be a given set of $D$ string documents of total length $n$, our task is to index $\D$, such that the $k$ most relevant documents for an online query pattern $P$ of length $p$ can be retrieved efficiently. We propose an index of size $|CSA|+n\log D(2+o(1))$ bits and $O(t_{s}(p)+k\log\log n+poly\log\log n)$ query time for the basic relevance metric \emph{term-frequency}, where $|CSA|$ is the size (in bits) of a compressed full text index of $\D$, with $O(t_s(p))$ time for searching a pattern of length $p$ . We further reduce the space to $|CSA|+n\log D(1+o(1))$ bits, however the query time will be $O(t_s(p)+k(\log σ\log\log n)^{1+ε}+poly\log\log n)$, where $σ$ is the alphabet size and $ε>0$ is any constant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。