lecture17-linkanalysis-handout-6-per

204 gap encodings given a sorted list of integers x

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: al Sec. 20.4 Boldi and Vigna 2004   h\p://www2004.org/proceedings/docs/1p595.pdf   Support for fast queries on the web graph   Webgraph – set of algorithms and a java implementa*on   Fundamental goal – maintain node adjacency lists in memory   Which URLs point to a given URL?   Which URLs does a given URL point to? Stores mappings in memory from   URL to outlinks, URL to inlinks   For this, compressing the adjacency lists is the cri*cal component   Applica*ons   Crawl control   Web graph analysis   Connec*vity, crawl op*miza*on   Link analysis Introduc)on to Informa)on Retrieval Sec. 20.4 Introduc)on to Informa)on Retrieval Adjacency lists Adjaceny list compression   The set of neighbors of a node   Assume each URL represented by an integer   E.g.,...
View Full Document

Ask a homework question - tutors are online