TY - GEN

T1 - Succinct indices for path minimum, with applications to path reporting

AU - Chan, Timothy M.

AU - He, Meng

AU - Munro, J. Ian

AU - Zhou, Gelin

PY - 2014

Y1 - 2014

N2 - In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O(α(m,n)) time, and occupies O(m) bits of space in addition to the space required for the input tree, where m is an integer greater than or equal to n and α(m,n) is the inverse-Ackermann function. These indices give us the first succinct data structures for the path minimum problem, and allow us to obtain new data structures for path reporting queries, which report the nodes along a query path whose weights are within a query range. We achieve three different time/space tradeoffs for path reporting by designing (a) an O(n)-word structure with O(lgεn+occ ·lg εn) query time, where occ is the number of nodes reported; (b) an O(n lg lg n)-word structure with O(lg lg n+occ · lg lg n)query time; and (c) an O(n lgεn) -word structure with O(lg lg n+occ) query time. These tradeoffs match the state of the art of two-dimensional orthogonal range reporting queries [8] 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.

AB - In the path minimum query problem, we preprocess a tree on n weighted nodes, such that given an arbitrary path, we can locate the node with the smallest weight along this path. We design novel succinct indices for this problem; one of our index structures supports queries in O(α(m,n)) time, and occupies O(m) bits of space in addition to the space required for the input tree, where m is an integer greater than or equal to n and α(m,n) is the inverse-Ackermann function. These indices give us the first succinct data structures for the path minimum problem, and allow us to obtain new data structures for path reporting queries, which report the nodes along a query path whose weights are within a query range. We achieve three different time/space tradeoffs for path reporting by designing (a) an O(n)-word structure with O(lgεn+occ ·lg εn) query time, where occ is the number of nodes reported; (b) an O(n lg lg n)-word structure with O(lg lg n+occ · lg lg n)query time; and (c) an O(n lgεn) -word structure with O(lg lg n+occ) query time. These tradeoffs match the state of the art of two-dimensional orthogonal range reporting queries [8] 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.

UR - http://www.scopus.com/inward/record.url?scp=84958545246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958545246&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-44777-2_21

DO - 10.1007/978-3-662-44777-2_21

M3 - Conference contribution

AN - SCOPUS:84958545246

SN - 9783662447765

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 247

EP - 259

BT - Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings

PB - Springer

T2 - 22nd Annual European Symposium on Algorithms, ESA 2014

Y2 - 8 September 2014 through 10 September 2014

ER -