In this paper, we present a compression technique for inverted lists that are specifically designed for XML keyword search
algorithms. In addition, we support all navigational operators required by such algorithms and these operators run faster
than on traditional inverted lists. Our technique requires small memory footprint and consumption, thus it is also ideal for
many resource constraint applications. Experiments show that our technique is efficient and scales well.