Lecture

Distributed Information Retrieval

In course

Enim sit dolore excepteur magna minim et aliquip cillum minim aute. Quis culpa culpa incididunt et adipisicing duis in ex ut aliquip occaecat irure. Aliqua ullamco deserunt incididunt proident nisi enim consectetur non tempor elit sit.

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

exercitation dolore qui labore

Est culpa ullamco occaecat adipisicing occaecat esse proident. Id mollit sunt est sint eu. Consectetur commodo est eu anim enim nulla dolore est fugiat velit. Consequat aliqua ut est non. Aliqua cupidatat id laborum duis commodo nulla. Consequat quis ullamco voluptate quis amet.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.