文献标引问题的数据结构下界
Data Structure Lower Bounds for Document Indexing Problems
摘要：
我们研究数据结构问题有关的文件索引和模式匹配查询和我们的主要贡献是表明，指针机模型的计算可以是非常有用的证明高和无条件的下限，不能在任何其他已知的计算模型与当前的技术。通常，我们的下界匹配已知的空间-查询时间权衡曲线，事实上，对于所有考虑的问题，我们的下界和已知的上界之间有一个非常好的和合理的匹配，至少对于一些输入参数的选择。我们考虑的问题是集合交集查询（报告变量和半组计数变量），索引一组文档的两个模式查询，或禁止模式查询，或查询通配符，和索引的输入集的缺口模式（或两个模式），以找到那些匹配的文档在查询时。
英文摘要：
We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in proving high and unconditional lower bounds that cannot be obtained in any other known model of computation with the current techniques. Often our lower bounds match the known space-query time trade-off curve and in fact for all the problems considered, there is a very good and reasonable match between the our lower bounds and the known upper bounds, at least for some choice of input parameters. The problems that we consider are set intersection queries (both the reporting variant and the semi-group counting variant), indexing a set of documents for two-pattern queries, or forbidden- pattern queries, or queries with wild-cards, and indexing an input set of gapped-patterns (or two-patterns) to find those matching a document given at the query time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
