Campus Event Calendar
Event Entry
What and Who
Probabilistic Scheduling for Top-k Index Processing
Anna Moleda
IMPRS
Masters' Lunch
AG 1, AG 2, AG 3, AG 4, AG 5
MPI Audience
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 25 January 2005
12:59
60 Minutes
46.1 - MPII
024
Saarbrücken
Contact
Kerstin Kathy Meyer-Ross
93 80 660
--email hidden
passcode not visible
logged in users only
Top-k queries are very important part of information retrieval.
Queries with multiple terms have to be processed fast and
effectively. The best known general-purpose algorithm for evaluating
top-k queries is Fagin's threshold algorithm. I will present an
algorithm which uses sorted accesses only and round-robin
scheduling. However an improvement on rate of performed sorted
accesses is possible using probabilistic score prediction and other
parameters for scheduling.
Kerstin Meyer-Ross, 01/18/2005 10:59 -- Created document.