Tight and simple Web graph compression for forward and reverse neighbor queries
Discrete Applied Mathematics
| Hi-index | 0.00 |
We describe a simple hierarchical scheme for webgraph compression, which supports efficient in-memory and from-disk decoding of page neighborhoods, for neighborhoods defined for both incoming and outgoing links. The scheme is highly competitive in terms of both compression effectiveness and decoding speed.