Dynamic fractional cascading

@article{Mehlhorn2005DynamicFC,
  title={Dynamic fractional cascading},
  author={Kurt Mehlhorn and Stefan N{\"a}her},
  journal={Algorithmica},
  year={2005},
  volume={5},
  pages={215-241}
}
The problem of searching for a key in many ordered lists arises frequently in computational geometry. Chazelle and Guibas recently introduced fractional cascading as a general technique for solving this type of problem. In this paper we show that fractional cascading also supports insertions into and deletions from the lists efficiently. More specifically, we show that a search for a key inn lists takes timeO(logN +n log logN) and an insertion or deletion takes timeO(log logN). HereN is the… Expand
View on Springer
publikationen.sulb.uni-saarland.de
122 Citations
Highly Influential Citations
11
Background Citations
31
Methods Citations
41
Results Citations
2

122 Citations

Citation Type

Citation Type

A Lower Bound for Dynamic Fractional Cascading
TLDR
A lower bound of $\Omega( \log n \sqrt{\log\log n})$ is proved on the worst-case query time of dynamic fractional cascading, when queries are paths of length $O(\log n)$. Expand
Chapter 4 Fractional Cascading
    In this chapter, we study an algorithm design principle called fractional cascading. Essentially, fractional cascading says that many problems can be solved by rst solving (recursively) a subproblem… Expand
    Dynamic Orthogonal Range Searching on the RAM, Revisited
    TLDR
    This work presents a new data structure achieving O(log n/log log n+k) optimal query time and O (log2/3+o(1)n) update time (amortized) in the word RAM model, where n is the number of data points and k is the output size. Expand
    Optimal Dynamic Strings
    TLDR
    This paper presents an efficient data structure for maintaining a dynamic collection of strings under the following operations, and proves that even if the only possible query is checking equality of two strings, either updates or queries take amortized $\Omega(\log n)$ time; hence the implementation is optimal. Expand
    Lower bounds for intersection searching and fractional cascading in higher dimension
    Given an n-edge convex subdivision of the plane, is it possible to report its k intersections with a query line segment in O(k + polylog(n)) time, using subquadratic storage? If the query is a plane… Expand
    2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
    • P. Afshani, P. Cheng
    • Computer Science
    • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
    • 2020
    TLDR
    This paper shows that it is actually possible to circumvent the lower bound of Chazelle and Liu for axis-aligned planar subdivisions for two-dimensional fractional cascading, and presents a number of upper and lower bounds which reveal that in two-dimensions, the problem has a much richer structure. Expand
    Reference Space Query Time Insertion Time Deletion Time Bentley
    In this paper we describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in O(logB n(log logB n) )) I/Os and… Expand
    Amortized Bounds for Dynamic Orthogonal Range Reporting
    TLDR
    The fundamental problem of 2-D dynamic orthogonal range reporting for 2- and 3-sided queries in the standard word RAM model is considered, and a step forward is made for an important problem that has not seen any progress in recent years. Expand
    Worst-Case Efficient Dynamic Geometric Independent Set
    TLDR
    Data structures that maintain a constant-factor approximate maximum independent set for broad classes of fat objects in d dimensions are presented, where d is assumed to be a constant, in sublinear worst-case update time. Expand
    Sequential Dependency Computation via Geometric Data Structures
    TLDR
    A geometric data structure is used to obtain a O(nlognloglogn) running time for a dynamic programming algorithm to compute the minimum number of insertions and deletions necessary to transform S"n into a valid sequence. Expand
    ...
    1
    2
    3
    4
    5
    ...

    References

    SHOWING 1-10 OF 65 REFERENCES
    Fractional cascading: I. A data structuring technique
    TLDR
    This paper shows that, if ordered lists can be put in a one-to-one correspondence with the nodes of a graph of degreed so that the iterative search always proceeds along edges of that graph, then this structure can be built, called afractional cascading structure, in which all original searches after the first can be carried out at only logd extra cost per search. Expand
    Maintaining order in a generalized linked list
    TLDR
    A representation for linked lists which allows to efficiently insert and delete objects in the list and to quickly determine the order of two list elements and an algorithm which determines the ancestor relationship of two given nodes in a dynamic tree structure of bounded degree in time O(1). Expand
    A new data structure for representing sorted lists
    TLDR
    A new data structure is proposed (level-linked weak B-trees) for representing sorted lists when the access pattern exhibits a (time-varying) locality of reference and can treat arbitrary sequences of insertions and deletions whilst theirs can only treat non-interacting insertion and deletion. Expand
    Dynamization of geometric data structures
    TLDR
    An amortized analysis of update cost in fractional cascading is given and it is shown that insertions take 0( 1) isortized time and insertions and deletions take0( log log X) amortization time. Expand
    Dynamic Orthogonal Segment Intersection Search
    TLDR
    The data structures developed here give new better solutions for various geometric problems on orthogonal segments by utilizing set-union and set-splitting algorithms. Expand
    New Data Structures for Orthogonal Queries.
    TLDR
    This report shows that many of the earlier results can be improved by a factor of log N with a slightly modified data structure that enables k-dimensional searches to be performed in O(log N) to the k-1 power) time. Expand
    A linear-time algorithm for a special case of disjoint set union
    TLDR
    A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance, which gives similar improvements in the efficiency of algorithms for solving a number of other problems. Expand
    Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization
    TLDR
    This work provides an efficient solution to the following problem, given a family of n rectilinear line segments in two-space, which serves to introduce a powerful new data structure, the layered segment tree, which is of independent interest. Expand
    Decomposable Searching Problems
    TLDR
    Transforms for converting a static structure into a dynamic structure, for adding 'range variables' to queries, and for making preprocessing/query time tradeoffs are presented. Expand
    A data structure for orthogonal range queries
    • G. S. Lueker
    • Computer Science
    • 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
    • 1978
    TLDR
    It is shown that a decision tree of height O(dn log n) can be constructed to process n operations in d dimensions, suggesting that the standard decision tree model will not provide a useful method for investigating the complexity of orthogonal range queries. Expand
    ...
    1
    2
    3
    4
    5
    ...