An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

DOI10.1137/10078791XzbMath1243.68157MaRDI QIDQ2884577

Lars Arge, Haim Kaplan, Eyal Molad, Ke Yi, Robert Endre Tarjan, Pankaj K. Agarwal

Publication date: 30 May 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

dynamic data structuressemigroup queriesstabbing queries

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items

Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³ ⋮ Random access in persistent strings and segment selection ⋮ Unnamed Item ⋮ Intersection joins under updates

This page was built for publication: An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries