ERA的理论与实验研究
ERA Revisited: Theoretical and Experimental Evaluation
摘要：
在给定输入文本的情况下，后缀树的有效构造从它首次被引入的时候起就是一个活跃的研究领域。理论计算机科学家和工程师都解决了这个问题。在本文中，我们专注于最快的实用后缀树构造算法，到目前为止，ERA。我们首先提供了一个理论分析的算法假设均匀随机文本作为输入，并使用PEM模型的计算相对于下限。其次，我们在不同的测试场景中暴露的关键条款，实证证实了理论结果。第三，我们讨论了输入文本的基本特征，其中最快的后缀树构造算法在实践中失败。本文为并行文本索引领域的进一步研究奠定了基础。
英文摘要：
Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical suffix tree construction algorithm to date, ERA. We first provide a theoretical analysis of the algorithm assuming the uniformly random text as an input and using the PEM model of computation with respect to the lower bounds. Secondly, we empirically confirm the theoretical results in different test scenarios exposing the critical terms. Thirdly, we discuss the fundamental characteristics of the input text where the fastest suffix tree construction algorithms in practice fail. This paper serves as a foundation for further research in the parallel text indexing area.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
