DSpace About DSpace Software
 

DSpace at Cochin University >
Department of Computer Science >
Seminar Reports >
MTech 2010-2012 Batch >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/3291

Title: Fast and Compact Webgraph Representations
Authors: Muhammed Anees V
Keywords: Compression, Web Graph, Re-pair algorithm, LZ78
Issue Date: 4-Jun-2011
Abstract: Compressed graph representations, in particular for Web graphs, have become an attractive research topic because of their applications in the manipulation of huge graphs in main memory. This seminar deal with two grammar-based compression mechanisms that used to compress the web graph. I focus on Re-Pair and on Ziv-Lempel compression, which, although cannot reach the best compression ratios of WebGraph, achievemuch faster navigation of the graph when both are tuned to use the same space. Moreover,the technique adapts well to run on secondary memory and in distributed scenarios. As a byprod- uct, we introduce an approximate Re-Pair version that works efficiently with severely limited main memory.
URI: http://hdl.handle.net/123456789/3291
Appears in Collections:MTech 2010-2012 Batch

Files in This Item:

File Description SizeFormat
Sem_anees.pdf462.41 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback