Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
verfasst von : Yakov Nekrich
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we describe a dynamic data structure that answers one-dimensional stabbing-max queries in optimal
O
(log
n
/loglog
n
) time. Our data structure uses linear space and supports insertions and deletions in
O
(log
n
) and
O
(log
n
/loglog
n
) amortized time respectively.
We also describe a
O
(
n
(log
n
/loglog
n
)
d
− 1
) space data structure that answers
d
-dimensional stabbing-max queries in
O
( (log
n
/loglog
n
)
d
) time. Insertions and deletions are supported in
O
((log
n
/loglog
n
)
d
loglog
n
) and
O
((log
n
/loglog
n
)
d
) amortized time respectively.