你要走多远才能找到你的捷径：空间高效的概要构造算法
How far will you walk to find your shortcut: Space Efficient Synopsis Construction Algorithms
摘要：
在本文中，我们考虑的小波摘要的建设问题，我们只选择一个子集的原始数据的系数的限制。我们提供了第一个接近最优的算法。我们通过考虑问题的受限版本的空间有效算法来得出上述算法。在这种情况下，我们改进了以前的算法几乎是线性的因素，并减少所需的空间几乎是线性的。我们的技术还扩展到直方图的建设，并提高空间运行时间的权衡V-Opt和范围查询直方图。我们相信这个想法适用于广泛的动态程序，并通过展示在Extended Wavelength构建中看到的背包式设置的改进来证明它。
英文摘要：
In this paper we consider the wavelet synopsis construction problem without the restriction that we only choose a subset of coefficients of the original data. We provide the first near optimal algorithm. We arrive at the above algorithm by considering space efficient algorithms for the restricted version of the problem. In this context we improve previous algorithms by almost a linear factor and reduce the required space to almost linear. Our techniques also extend to histogram construction, and improve the space-running time tradeoffs for V-Opt and range query histograms. We believe the idea applies to a broad range of dynamic programs and demonstrate it by showing improvements in a knapsack-like setting seen in construction of Extended Wavelets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
