Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287623660> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W4287623660 abstract "We investigate the limits of one of the fundamental ideas in data structures: fractional cascading. This is an important data structure technique to speed up repeated searches for the same key in multiple lists and it has numerous applications. Specifically, the input is a catalog graph, $G$, of constant degree together with a list of values assigned to every vertex of $G$. The goal is to preprocess the input such that given a connected subgraph $H$ of $G$ and a single query value $q$, one can find the predecessor of $q$ in every list that belongs to $scat$. The classical result by Chazelle and Guibas shows that in a pointer machine, this can be done in the optimal time of $O(log n + |scat|)$ where $n$ is the total number of values. However, if insertion and deletion of values are allowed, then the query time slows down to $O(log n + |scat| loglog n)$. If only insertions (or deletions) are allowed, then once again, an optimal query time can be obtained but by using amortization at update time. We prove a lower bound of $Omega( log n sqrt{loglog n})$ on the worst-case query time of dynamic fractional cascading, when queries are paths of length $O(log n)$. The lower bound applies both to fully dynamic data structures with amortized polylogarithmic update time and incremental data structures with polylogarithmic worst-case update time. As a side, this also roves that amortization is crucial for obtaining an optimal incremental data structure. This is the first non-trivial pointer machine lower bound for a dynamic data structure that breaks the $Omega(log n)$ barrier. In order to obtain this result, we develop a number of new ideas and techniques that hopefully can be useful to obtain additional dynamic lower bounds in the pointer machine model." @default.
- W4287623660 created "2022-07-25" @default.
- W4287623660 creator A5035056543 @default.
- W4287623660 date "2020-11-01" @default.
- W4287623660 modified "2023-09-29" @default.
- W4287623660 title "A Lower Bound for Dynamic Fractional Cascading" @default.
- W4287623660 doi "https://doi.org/10.48550/arxiv.2011.00503" @default.
- W4287623660 hasPublicationYear "2020" @default.
- W4287623660 type Work @default.
- W4287623660 citedByCount "0" @default.
- W4287623660 crossrefType "posted-content" @default.
- W4287623660 hasAuthorship W4287623660A5035056543 @default.
- W4287623660 hasBestOaLocation W42876236601 @default.
- W4287623660 hasConcept C114614502 @default.
- W4287623660 hasConcept C118615104 @default.
- W4287623660 hasConcept C121332964 @default.
- W4287623660 hasConcept C132525143 @default.
- W4287623660 hasConcept C134306372 @default.
- W4287623660 hasConcept C162319229 @default.
- W4287623660 hasConcept C199360897 @default.
- W4287623660 hasConcept C2779557605 @default.
- W4287623660 hasConcept C33923547 @default.
- W4287623660 hasConcept C41008148 @default.
- W4287623660 hasConcept C62520636 @default.
- W4287623660 hasConcept C63553672 @default.
- W4287623660 hasConcept C77553402 @default.
- W4287623660 hasConcept C80899671 @default.
- W4287623660 hasConceptScore W4287623660C114614502 @default.
- W4287623660 hasConceptScore W4287623660C118615104 @default.
- W4287623660 hasConceptScore W4287623660C121332964 @default.
- W4287623660 hasConceptScore W4287623660C132525143 @default.
- W4287623660 hasConceptScore W4287623660C134306372 @default.
- W4287623660 hasConceptScore W4287623660C162319229 @default.
- W4287623660 hasConceptScore W4287623660C199360897 @default.
- W4287623660 hasConceptScore W4287623660C2779557605 @default.
- W4287623660 hasConceptScore W4287623660C33923547 @default.
- W4287623660 hasConceptScore W4287623660C41008148 @default.
- W4287623660 hasConceptScore W4287623660C62520636 @default.
- W4287623660 hasConceptScore W4287623660C63553672 @default.
- W4287623660 hasConceptScore W4287623660C77553402 @default.
- W4287623660 hasConceptScore W4287623660C80899671 @default.
- W4287623660 hasLocation W42876236601 @default.
- W4287623660 hasLocation W42876236602 @default.
- W4287623660 hasOpenAccess W4287623660 @default.
- W4287623660 hasPrimaryLocation W42876236601 @default.
- W4287623660 hasRelatedWork W18873129 @default.
- W4287623660 hasRelatedWork W28580575 @default.
- W4287623660 hasRelatedWork W38294843 @default.
- W4287623660 hasRelatedWork W48221434 @default.
- W4287623660 hasRelatedWork W5166145 @default.
- W4287623660 hasRelatedWork W52795131 @default.
- W4287623660 hasRelatedWork W55838289 @default.
- W4287623660 hasRelatedWork W63325702 @default.
- W4287623660 hasRelatedWork W9065265 @default.
- W4287623660 hasRelatedWork W34844546 @default.
- W4287623660 isParatext "false" @default.
- W4287623660 isRetracted "false" @default.
- W4287623660 workType "article" @default.