Optimizing distributed top-k queries

Thomas Neumann, Matthias Bender, Sebastian Michel, Ralf Schenkel, Peter Triantafillou, Gerhard Weikum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper introduces novel optimization methods for top-k aggregation queries in such distributed environments that can be applied to all algorithms that fall into the frameworks of the prior TPUT and KLEE methods. The optimizations address 1) hierarchically grouping input lists into top-k operator trees and optimizing the tree structure, and 2) computing data-adaptive scan depths for different input sources. The paper presents comprehensive experiments with two different real-life datasets, using the ns-2 network simulator for a packet-level simulation of a large Internet-style network.

Original languageEnglish
Title of host publicationWeb Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings
Pages337-349
Number of pages13
DOIs
StatePublished - 2008
Externally publishedYes
Event9th International Conference on Web Information Systems Engineering, WISE 2008 - Auckland, New Zealand
Duration: 1 Sep 20083 Sep 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5175 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Web Information Systems Engineering, WISE 2008
Country/TerritoryNew Zealand
CityAuckland
Period1/09/083/09/08

Fingerprint

Dive into the research topics of 'Optimizing distributed top-k queries'. Together they form a unique fingerprint.

Cite this