Efficient processing of distributed top-k queries

Hailing Yu, Hua Gang Li, Ping Wu, Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalConference article

Abstract

Ranking-aware queries, or top-k queries, have received much attention recently in various contexts such as web, multimedia retrieval, relational databases, and distributed systems. Top-k queries play a critical role in many decision-making related activities such as, identifying interesting objects, network monitoring, load balancing, etc. In this paper, we study the ranking aggregation problem in distributed systems. Prior research addressing this problem did not take data distributions into account, simply assuming the uniform data distribution among nodes, which is not realistic for real data sets and is, in general, inefficient. In this paper, we propose three efficient algorithms that consider data distributions in different ways. Our extensive experiments demonstrate the advantages of our approaches in terms of bandwidth consumption.

Original languageEnglish
Pages (from-to)65-74
Number of pages10
JournalLecture Notes in Computer Science
Volume3588
Publication statusPublished - 24 Oct 2005
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: 22 Aug 200526 Aug 2005

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yu, H., Li, H. G., Wu, P., Agrawal, D., & El Abbadi, A. (2005). Efficient processing of distributed top-k queries. Lecture Notes in Computer Science, 3588, 65-74.