'Issippi mi' presentation slideshows

Document Compression

385 views • 37 slides

Compressed storage of the Web-graph

Compressed storage of the Web-graph. Definition. Directed graph G = (V,E) V = URLs, E = (u,v) if u has an hyperlink to v Isolated URLs are ignored (no IN & no OUT) Three key properties: Skewed distribution : Pb that a node has x links is 1/x a , a ? 2.1. The In-degree distribution.

374 views • 36 slides

On Compression and Indexing: two sides of the same coin

347 views • 33 slides

Algoritmi per IR

445 views • 26 slides

Web Algorithmics

392 views • 24 slides