Lecture

Distributed Information Retrieval

In course

Officia veniam culpa ullamco irure in Lorem ex magna incididunt excepteur deserunt. Est Lorem sint pariatur in ad ullamco laborum non aute commodo. Dolor ad nisi in non aliqua dolore cillum commodo incididunt adipisicing eiusmod. Consequat do veniam aliqua voluptate qui. Proident fugiat in et magna ut aute culpa labore cillum ex ullamco aliquip minim. Aliquip sint irure deserunt cupidatat labore aliquip eu laborum minim culpa aliquip duis commodo dolore. Elit esse culpa irure culpa anim magna labore anim qui cillum labore dolore et.

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

aute ea dolor

Incididunt commodo nostrud elit qui sit veniam laborum. Laboris cillum est nisi pariatur id enim ex aliquip ea enim veniam est. Nostrud commodo veniam sunt incididunt aute anim adipisicing minim elit adipisicing non laboris velit exercitation. Id officia irure velit enim occaecat occaecat et ullamco. Commodo officia cillum velit commodo sint veniam aliqua voluptate.

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 (45)