Searching in Dynamic Tree-Like Partial Orders [chapter]

Brent Heeringa, Marius Cătălin Iordan, Louis Theran
2011 Lecture Notes in Computer Science  
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the operations: insert; delete; test membership; and predecessor. The performance of our data structure is within an O(log w)-factor of optimal. Here w ≤ n is the width of the partialorder-a natural obstacle in searching a partial order.
doi:10.1007/978-3-642-22300-6_43 fatcat:4kztnemq7jcsphodulj5k5i3u4