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

有偏的前代搜索

Biased Predecessor Search

Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin

摘要:

我们考虑的问题,执行前任搜索在一个有界的宇宙,同时实现查询时间依赖于查询的分布。我们得到几个数据结构具有各种属性:特别是,我们给数据结构,实现预期的查询时间对数的熵分布的查询,但与空间有界的宇宙大小,以及数据结构,只使用线性空间,但查询时间是更高的(但仍然是次线性)函数的熵。对于这些结构,假设分布是已知的。我们还考虑了具有一般权重的宇宙元素上的单个查询时间,以及事先不知道分布的情况。

英文摘要:

We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic in the entropy of the distribution of queries but with space bounded in terms of universe size, as well as data structures that use only linear space but with query times that are higher (but still sublinear) functions of the entropy. For these structures, the distribution is assumed to be known. We also consider individual query times on universe elements with general weights, as well as the case when the distribution is not known in advance.

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

↑