A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this paper, we develop a new communication model to prove a data structure lower bound for the dynamic interval union problem. The problem is to maintain a multiset of intervals I over [0, n] with integer coordinates, supporting the following operations: - insert(a, b): add an interval [a, b] to I, provided that a and b are integers in [0, n]; - delete(a, b): delete a (previously inserted) interval [a, b] from I; - query(): return the total length of the union of all intervals in I. It isarXiv:1512.01293v1 fatcat:yl32fnk2pzda3oi7dxdj2zml6a