Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal Dynamic Strings

Published 9 Nov 2015 in cs.DS | (1511.02612v2)

Abstract: In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical order (less, equal, greater) between two strings, LCP - calculates the longest common prefix of two strings. We present an efficient data structure for this problem, where an update requires only O(log⁡n)O(\log n) worst-case time with high probability, with nn being the total length of all strings in the collection, and a query takes constant worst-case time. On the lower bound side, we prove that even if the only possible query is checking equality of two strings, either updates or queries take amortized Ω(log⁡n)\Omega(\log n) time; hence our implementation is optimal. Such operations can be used as a basic building block to solve other string problems. We provide two examples. First, we can augment our data structure to provide pattern matching queries that may locate occurrences of a specified pattern pp in the strings in our collection in optimal O(∣p∣)O(|p|) time, at the expense of increasing update time to O(log⁡2n)O(\log^2 n). Second, we show how to maintain a history of an edited text, processing updates in O(log⁡tlog⁡log⁡t)O(\log t \log \log t) time, where tt is the number of edits, and how to support pattern matching queries against the whole history in O(∣p∣log⁡tlog⁡log⁡t)O(|p| \log t \log \log t) time. Finally, we note that our data structure can be applied to test dynamic tree isomorphism and to compare strings generated by dynamic straight-line grammars.

Citations (58)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.