Data Structures with Local Update Operations

• Authors: Yakov Nekrich
• Venue: SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
• Year: 2008

In this paper we describe dynamic data structures with restrictions on update operations. In the first part of the paper we consider data structures that support operations insertΔ(x,y) or insertΔ(x) instead of general insertions, where insertΔ(x,y) (insertΔ(x)) inserts a new element x, such that |x茂戮驴 y| ≤ Δfor some element yalready stored in the data structure. We present a data structure that supports predecessor queries in a universe of size Uin O(loglogU) time, uses O(n) words of space, and supports operations insertΔ(x,y), and in O(1) amortized time, where $\Delta=2^{2^{O(\sqrt{\log \log U})}}$. We present the dictionary data structure that supports membership queries in O(loglogn) time and insertΔ(x,y) and delete (x) in O(1) amortized time, where $\Delta=2^{2^{O(\sqrt{\log \log n})}}$ We also present a priority queue that supports , and in O(1) time and in O(loglogn) time, where Δ= logO(1)U. All above data structures also support incrementation and decrementation of element values by the corresponding parameter Δ.In the second part of this paper, we consider the data structure for dominance emptiness queries in the case when an update changes the relative order of two points or increments/decrements coordinates of a point by a small parameter. We show that in this case dominance emptiness queries can be answered faster than the lower bound for the fully dynamic data structure.