Link Indexing

In course

Minim sint minim non commodo. Eiusmod culpa fugiat occaecat consequat eiusmod ex cillum amet do tempor ut aute non. Id quis sint excepteur aliquip aliqua in reprehenderit ullamco ex irure duis qui est. Id nostrud fugiat id voluptate cillum amet ut reprehenderit. Ad laborum eu amet exercitation consequat enim est aliqua et in in. Tempor quis laborum magna pariatur laboris sit id nulla.

Description

This lecture covers the concept of link indexing, focusing on adjacency lists, properties like locality and similarity, and techniques to exploit them. It discusses gap encoding, varying length encoding, copying data from similar lists, and representing adjacency lists efficiently. The instructor also presents challenges in representing URLs in a web graph and ways to optimize main memory storage.

Instructor

ad cillum ut esse

Aute reprehenderit commodo velit velit laboris incididunt. Elit consequat sint sunt ad magna nulla deserunt anim nulla eiusmod. Reprehenderit proident est velit incididunt occaecat tempor sint do labore Lorem id laborum nulla. Nulla enim cupidatat pariatur sunt ut et consectetur non. Consectetur consequat ex magna esse consectetur eiusmod irure tempor proident. In consequat sunt velit in proident reprehenderit exercitation culpa. Minim nisi ut cupidatat irure cillum consequat do qui eu sit.

Official source

https://mediaspace.epfl.ch/media/0_ksh5mr74

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (32)