Yi Ke-An Optimal Dynamic Interval Stabbing-Max Data Stru.pptVIP

ddd An Optimal Dynamic Interval Stabbing-Max Data Structure? Pankaj K. Agarwal, Lars Arge and Ke Yi Department of Computer Science Duke University Problem Definition S : n intervals in 1D w(s) : weight of s?S; w(s)?R Stabbing-max query q?R : max{w(s) | s?S, q?s} Previous Results Trivial if no deletions A binary search tree: O(n) space, O(log n) query insert Interval tree Size: O(n) Query: O(log2 n) Insert: O(log n) Delete: O(log n) Kaplan, Molad and Tarjan [STOC’03] The best known result Size: O(n) Query: O(log n) Insert: O(log n) Delete: O(log n loglog n) Our Results Trivial if no deletions A binary search tree: O(n) space, O(log n) query insert Interval tree Size: O(n) Query: O(log2 n) Insert: O(log n) Delete: O(log n) Kaplan, Molad and Tarjan [STOC’03] The best known result Size: O(n) Query: O(log n) Insert: O(log n) Delete: O(log n loglog n) Base Tree T Main idea: use a base interval tree with fan-out f = Height of tree: O(log n / loglog n) Each leaf stores Q(log n) endpoints O(n / log3/2 n) internal nodes, O(n / log n) nodes in total Base Tree T Middle Segments: Overview Answers query within S(v) in O(loglog n) time O(log n / loglog n) nodes on the path O(log n) time in total Insert or delete a segment in O(log n) time Only one Mv is affected Total time: O(log n) Size: O(|S(v)| + log3/2 n) O(n / log3/2 n) internal nodes Total size: O(n) Secondary Structure Mv Build a multislab heap for each multislab Stores all segments spanning exactly this multislab Build a slab heap for each slab Stores the top elements of the relevant multislab heaps Query: O(loglog n) Find the slab heap Update: O(log n) Update the multislab heap: O(log n) Update the slab heaps: Left Segments: A Static Structure L(v) : segments in ?iS(ui) with left endpoints in the slab of v Basic idea: answer query inL(v) ? L(w4) when visiting v f(wj) : maximum interval inL(v) with left endpoint in the slab of wj Organize in a tournament tree Can find the maximumof the red segmentsin time