最坏情况下最优时间更新下的三角形计数
Counting Triangles under Updates in Worst-Case Optimal Time
摘要:
我们考虑的问题,增量维护三角形计数查询下的单元组更新的输入关系。我们介绍了一种方法,表现出的空间-时间的权衡,使空间-时间的产品是二次的输入数据库的大小和更新时间可以低到这个大小的平方根。这个最低的更新时间是最坏情况下的最佳在线矩阵向量乘法猜想的条件。经典的和因式分解的增量视图维护方法被恢复为我们的方法在时空权衡的特殊情况。特别是,它们需要线性时间更新维护,这是次优的。我们的方法还恢复了最坏情况下的最佳时间复杂度计算三角形计数在非增量设置。
英文摘要:
We consider the problem of incrementally maintaining the triangle count query under single-tuple updates to the input relations. We introduce an approach that exhibits a space-time tradeoff such that the space-time product is quadratic in the size of the input database and the update time can be as low as the square root of this size. This lowest update time is worst-case optimal conditioned on the Online Matrix-Vector Multiplication conjecture. The classical and factorized incremental view maintenance approaches are recovered as special cases of our approach within the space-time tradeoff. In particular, they require linear-time update maintenance, which is suboptimal. Our approach also recovers the worst-case optimal time complexity for computing the triangle count in the non-incremental setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。