NDLI: Fast and Compact Web Graph Representations

Please wait, while we are loading the content...

Fast and Compact Web Graph Representations

Content Provider	ACM Digital Library
Author	Claude, Francisco Navarro, Gonzalo
Copyright Year	2010
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. The state of the art is well represented by the $\textit{WebGraph}$ project, where advantage is taken of several particular properties of Web graphs to offer a trade-off between space and access time. In this paper we show that the same properties can be exploited with a different and elegant technique that builds on grammar-based compression. In particular, we focus on Re-Pair and on Ziv-Lempel compression, which, although cannot reach the best compression ratios of WebGraph, achieve much 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 byproduct, we introduce an approximate Re-Pair version that works efficiently with severely limited main memory.
Starting Page	1
Ending Page	31
Page Count	31
File Format	PDF
ISSN	15591131
e-ISSN	1559114X
DOI	10.1145/1841909.1841913
Volume Number	4
Issue Number	4
Journal	ACM Transactions on the Web (TWEB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-09-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Compression Data Structures Web Graph
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Web graph compression by edge elimination

Querying the Data Web: The MashQL Approach

NautiLOD: A Formal Language for the Web of Data Graph

Succinct Posets

Fast and compact web graph representations (2007).

Web graph compression with fast access

Compressed representations for web and social graphs

W-tree: A Compact External Memory Representation for Webgraphs

The Web as a graph: How far we are

Fast and Compact Web Graph Representations

Similar Documents

Web graph compression by edge elimination

Querying the Data Web: The MashQL Approach

NautiLOD: A Formal Language for the Web of Data Graph

Succinct Posets

Fast and compact web graph representations (2007).

Web graph compression with fast access

Compressed representations for web and social graphs

W-tree: A Compact External Memory Representation for Webgraphs

The Web as a graph: How far we are

Fast and Compact Web Graph Representations