Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals

We present a data structure to maintain a set of intervals on the real line subject to fast insertions and deletions of the intervals, stabbing queries, and local updates. Intuitively, a local update replaces an interval by another one of roughly the same size and location. We investigate whether local updates can be implemented faster than a deletion followed by an insertion.

[1]  Jeffrey Scott Vitter,et al.  Optimal dynamic interval management in external memory , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  Haim Kaplan,et al.  An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries , 2012, SIAM J. Comput..

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Stephen Alstrup,et al.  Marked ancestor problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Haim Kaplan,et al.  Dynamic rectangular intersection with priorities , 2003, STOC '03.

[6]  Yakov Nekrich.  Data Structures with Local Update Operations , 2008, SWAT.

[7]  Mikkel Thorup.  Space efficient dynamic stabbing with fast queries , 2003, STOC '03.

[8]  Maarten Löffler,et al.  Dynamic Planar Point Location with Sub-logarithmic Local Updates , 2012, WADS.

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[10]  Yakov Nekrich.  A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time , 2011, ISAAC.

[11]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..