Consider a tree T on n nodes, each having a weight drawn from [1..Ïƒ]. In this paper, we design succinct data structures to encode T using nH(WT ) + o(n lg Ïƒ) bits of space, such that we can supportâ€¦ (More)

Trees are fundamental structures in computer science, being widely used in modeling and representing different types of data in numerous computer applications. In many cases, properties of objectsâ€¦ (More)

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â€¦ (More)

Consider a tree <i>T</i> on <i>n</i> nodes, each having a weight drawn from [1â€¥Ïƒ]. In this article, we study the problem of supporting various path queries over the tree <i>T</i>. The path countingâ€¦ (More)

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â€¦ (More)

We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lg lgn) words of space and O(lg lg n+ k lg lg n) query time, where k is the number of points in theâ€¦ (More)

In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the wordâ€¦ (More)