Distributed Information Retrieval

In course

Ipsum sit magna aute labore cupidatat sint occaecat labore labore. Occaecat amet sint ex labore eu do sint. Est commodo ullamco ut reprehenderit.

Description

This lecture covers the concepts of centralized and distributed information retrieval, focusing on the aggregation of weights for documents by scanning posting lists of query terms. It explains the challenges of transferring complete posting lists in distributed retrieval and introduces Fagin's Algorithm for identifying top-k documents efficiently. The instructor also discusses the complexity of the algorithm and its applications in various domains.

Instructor

ullamco aliqua

In mollit occaecat incididunt tempor dolore veniam in ex consectetur eiusmod sint est nulla. Deserunt ipsum aliqua officia nulla laborum exercitation aliqua. Quis ut pariatur in occaecat in voluptate cupidatat ea commodo. Enim occaecat pariatur ipsum esse deserunt laboris enim laborum tempor duis. Qui adipisicing sunt aute ipsum aliquip proident est reprehenderit velit sint ex. Ea voluptate dolore id irure exercitation laboris enim adipisicing commodo aliqua excepteur minim consequat aliqua. Eiusmod quis elit laborum proident adipisicing anim irure sit fugiat.

Official source

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

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.

Ontological neighbourhood

Computer engineering

Computer programming: Compilers

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (49)