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

高效的树结构分类检索

Efficient tree-structured categorical retrieval

Djamal Belazzougui, Gregory Kucherov

摘要:

我们研究了一个文件检索问题,在新的框架中,$D$文本文件被组织在一个{ \em类别树}与一个预定义的数量$h$的类别。这种情况发生在生物学中的分类树或科学文献的主题分类系统中。给定一个字符串模式$p$和一个类别(类别树中的级别),我们希望有效地检索包含该模式并属于该类别的$t$ \emph{categorical units}。我们提出了几个有效的解决方案,这个问题。其中之一使用$n(\logσ(1+o(1))+\log D+O(h)) + O(Δ)$空间位和$O(|p|+t)$查询时间,其中$n$是文档的总长度,$σ$是文档中使用的字母表的大小,$Δ$是类别树中节点的总数。另一种解决方案使用$n(\logσ(1+o(1))+O(\log D))+O(Δ)+O(D\log n)$空间位和$O(|p|+t\log D)$查询时间。最后,我们提出了其他的解决方案,这是更节省空间的查询时间略有增加的代价。

英文摘要:

We study a document retrieval problem in the new framework where $D$ text documents are organized in a {\em category tree} with a pre-defined number $h$ of categories. This situation occurs e.g. with taxomonic trees in biology or subject classification systems for scientific literature. Given a string pattern $p$ and a category (level in the category tree), we wish to efficiently retrieve the $t$ \emph{categorical units} containing this pattern and belonging to the category. We propose several efficient solutions for this problem. One of them uses $n(\logσ(1+o(1))+\log D+O(h)) + O(Δ)$ bits of space and $O(|p|+t)$ query time, where $n$ is the total length of the documents, $σ$ the size of the alphabet used in the documents and $Δ$ is the total number of nodes in the category tree. Another solution uses $n(\logσ(1+o(1))+O(\log D))+O(Δ)+O(D\log n)$ bits of space and $O(|p|+t\log D)$ query time. We finally propose other solutions which are more space-efficient at the expense of a slight increase in query time.

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

↑