Succinct Indices for Path Minimum, with Applications

Abstract

In the path minimum problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, the node with the smallest weight along this path can be located. We design novel succinct indices for this problem under the indexing model, for which weights of nodes are read-only and can be accessed with ranks of nodes in the preorder traversal sequence of the input tree. We presentan index within O(m) bits of additional space that supports queries in $$O(\varvec{\alpha }(m, n))$$O(ź(m,n)) time and $$O(\varvec{\alpha }(m, n))$$O(ź(m,n)) accesses to the weights of nodes, for any integer $$m \ge n$$mźn; andan index within $$2n + o(n)$$2n+o(n) bits of additional space that supports queries in $$O(\varvec{\alpha }(n))$$O(ź(n)) time and $$O(\varvec{\alpha }(n))$$O(ź(n)) accesses to the weights of nodes. Here $$\varvec{\alpha }(m, n)$$ź(m,n) is the inverse-Ackermann function, and $$\varvec{\alpha }(n) = \varvec{\alpha }(n, n)$$ź(n)=ź(n,n). These indices give us the first succinct data structures for the path minimum problem. Following the same approach, we also develop succinct data structures for semigroup path sum queries, for which a query asks for the sum of weights along a given query path. One of our data structures requires $$n\lg \sigma + 2n + o(n\lg \sigma )$$nlgź+2n+o(nlgź) bits of space and $$O(\varvec{\alpha }(n))$$O(ź(n)) query time, where $$\sigma $$ź is the size of the semigroup. In the path reporting problem, queries ask for the nodes along a query path whose weights are within a two-sided query range. Using the succinct indices for path minimum queries, we achieve three different time/space tradeoffs for path reporting by designingan O(n)-word data structure with $$O(\lg ^\epsilon n + occ \cdot \lg ^\epsilon n)$$O(lg∈n+occ·lg∈n) query time;an $$O(n\lg \lg n)$$O(nlglgn)-word data structure with $$O(\lg \lg n + occ \cdot \lg \lg n)$$O(lglgn+occ·lglgn) query time; andan $$O(n \lg ^\epsilon n)$$O(nlg∈n)-word data structure with $$O(\lg \lg n + occ)$$O(lglgn+occ) query time. Here occ is the number of nodes reported and $$\epsilon $$∈ is an arbitrary constant between 0 and 1. These tradeoffs match the state of the art of two-dimensional orthogonal range reporting queries (Chan et al. 2011), which can be treated as a special case of path reporting queries. When the number of distinct weights is much smaller than n, we further improve both the query time and the space cost of these three results.