Efficient processing of distributed top-k queries

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

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
Title of host publicationLecture Notes in Computer Science
EditorsK.V. Andersen, J. Debenham, R. Wagner
Pages65-74
Number of pages10
Volume3588
Publication statusPublished - 2005
Externally publishedYes
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: 22 Aug 200526 Aug 2005

Other

Other16th International Conference on Database and Expert Systems Applications, DExa 2005
CountryDenmark
CityCopenhagen
Period22/8/0526/8/05

Fingerprint

Resource allocation
Agglomeration
Decision making
Bandwidth
Monitoring
Processing
Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Yu, H., Li, H. G., Wu, P., Agrawal, D., & El Abbadi, A. (2005). Efficient processing of distributed top-k queries. In K. V. Andersen, J. Debenham, & R. Wagner (Eds.), Lecture Notes in Computer Science (Vol. 3588, pp. 65-74)

Efficient processing of distributed top-k queries. / Yu, Hailing; Li, Hua Gang; Wu, Ping; Agrawal, Divyakant; El Abbadi, Amr.

Lecture Notes in Computer Science. ed. / K.V. Andersen; J. Debenham; R. Wagner. Vol. 3588 2005. p. 65-74.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, H, Li, HG, Wu, P, Agrawal, D & El Abbadi, A 2005, Efficient processing of distributed top-k queries. in KV Andersen, J Debenham & R Wagner (eds), Lecture Notes in Computer Science. vol. 3588, pp. 65-74, 16th International Conference on Database and Expert Systems Applications, DExa 2005, Copenhagen, Denmark, 22/8/05.
Yu H, Li HG, Wu P, Agrawal D, El Abbadi A. Efficient processing of distributed top-k queries. In Andersen KV, Debenham J, Wagner R, editors, Lecture Notes in Computer Science. Vol. 3588. 2005. p. 65-74
Yu, Hailing ; Li, Hua Gang ; Wu, Ping ; Agrawal, Divyakant ; El Abbadi, Amr. / Efficient processing of distributed top-k queries. Lecture Notes in Computer Science. editor / K.V. Andersen ; J. Debenham ; R. Wagner. Vol. 3588 2005. pp. 65-74
@inproceedings{771b2f34b9844c719a3189afbc3a5b55,
title = "Efficient processing of distributed top-k queries",
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.",
author = "Hailing Yu and Li, {Hua Gang} and Ping Wu and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2005",
language = "English",
volume = "3588",
pages = "65--74",
editor = "K.V. Andersen and J. Debenham and R. Wagner",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Efficient processing of distributed top-k queries

AU - Yu, Hailing

AU - Li, Hua Gang

AU - Wu, Ping

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=26844557807&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844557807&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3588

SP - 65

EP - 74

BT - Lecture Notes in Computer Science

A2 - Andersen, K.V.

A2 - Debenham, J.

A2 - Wagner, R.

ER -