arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.0072cs.DS
收藏

小空间动态二维字典匹配

Dynamic 2D Dictionary Matching in Small Space

Shoshana Marcus, Dina Sokol

摘要:

字典匹配问题预处理一组模式,并在文本中找到每个模式的所有出现。我们专注于动态设置,其中模式可以插入到字典和从字典中删除,而无需重新处理整个字典。本文提出了第一个在小空间内对二维数据进行\emph{dynamic}字典匹配的算法。我们的算法的时间复杂度几乎是线性的。唯一的减速是查询替换字典的压缩自索引。字典的更新时间与插入到字典中或从字典中删除的模式的大小成比例。该算法适用于一维均匀尺寸的矩形图案。

英文摘要:

The dictionary matching problem preprocesses a set of patterns and finds all occurrences of each of the patterns in a text when it is provided. We focus on the dynamic setting, in which patterns can be inserted to and removed from the dictionary, without reprocessing the entire dictionary. This article presents the first algorithm that performs \emph{dynamic} dictionary matching on two-dimensional data within small space. The time complexity of our algorithm is almost linear. The only slowdown is incurred by querying the compressed self-index that replaces the dictionary. The dictionary is updated in time proportional to the size of the pattern that is being inserted to or removed from the dictionary. Our algorithm is suitable for rectangular patterns that are of uniform size in one dimension.

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

↑