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 inves-tigate whether local updates can be implemented faster than a deletion followed by an insertion. We present the first results for this problem for sets of possibly over-lapping intervals. If the maximum depth of the overlap (a.k.a. ply) is bounded by a constant, our data structure performs insertions, dele-tions and stabbing queries in time O(log n), and local updates in time O(log n/ log log n), where n is the number of intervals. We also analyze the dependence on the ply when it is not constant. Our results are adap-tive: the times depend on the current ply at the time of each operation.
Original language | English |
---|---|
Title of host publication | Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings |
Editors | Pascal Weil |
Publisher | Springer Nature |
Pages | 176-190 |
Number of pages | 15 |
ISBN (Print) | 9783319587462 |
DOIs | |
State | Published - 1 Jan 2017 |
Externally published | Yes |
Event | 12th International Computer Science Symposium in Russia, CSR 2017 - Kazan, Russian Federation Duration: 8 Jun 2017 → 12 Jun 2017 |
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10304 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference | 12th International Computer Science Symposium in Russia, CSR 2017 |
---|---|
Country/Territory | Russian Federation |
City | Kazan |
Period | 8/06/17 → 12/06/17 |
ID: 38614417