MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Probabilistic Scheduling for Top-k Query Processing

Anna Moleda
Ph.D. application talk
AG 1, AG 2, AG 3, AG 4, AG 5  
MPI Audience

Date, Time and Location

Friday, 30 September 2005
09:00
30 Minutes
46.1 - MPII
0.24
Saarbrücken

Abstract

Nowdays Internet search engines such as Google, Yahoo or MSN

    Search are ubiquitous. They rely on efficient text retrieval techniques
    as the WWW consists of bilions of documents already.

    The core of every Internet search engine is the index and one of
    the fundamental index processing techniques are top-k queries. I will
    present two basic algorithms for evaluating them: No Random
    Access Algorithm (NRA) and Combined Algorithm (CA).

    The aim of the presentation is to introduce a method of queue
    vector scheduling that accelerates the query processing. The method
    is based on selectivity estimators and score predictions. It has been
    experimentally evaluated based on a large Web corpus and tested for
    efficiency and recall measures.

Contact

Kerstin Meyer-Ross
226
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Ph.D. Application Talks

Friederike Gerndt, 09/27/2005 14:24
Friederike Gerndt, 09/27/2005 14:20 -- Created document.