Show simple item record

dc.contributor.authorZeinalipour-Yazdi, Constantinos D.en
dc.contributor.authorVagena, Zografoulaen
dc.contributor.authorKalogeraki, Vanaen
dc.contributor.authorGunopulos, Dimitriosen
dc.contributor.authorTsotras, Vassilis J.en
dc.contributor.authorVlachos, Michailen
dc.contributor.authorKoudas, Nicken
dc.contributor.authorSrivastava, D.en
dc.creatorZeinalipour-Yazdi, Constantinos D.en
dc.creatorVagena, Zografoulaen
dc.creatorKalogeraki, Vanaen
dc.creatorGunopulos, Dimitriosen
dc.creatorTsotras, Vassilis J.en
dc.creatorVlachos, Michailen
dc.creatorKoudas, Nicken
dc.creatorSrivastava, D.en
dc.description.abstractIn this paper, we present an algorithm for finding the k highest-ranked (or Top-k) answers in a distributed network. A Top-K query returns the subset of most relevant answers, in place of all answers, for two reasons: (i) to minimize the cost metric that is associated with the retrieval of all answersen
dc.description.abstractand (ii) to improve the recall and the precision of the answer-set, such that the user is not overwhelmed with irrelevant results. Our study focuses on multi-hop distributed networks in which the data is accessible by traversing a network of nodes. Such a setting captures very well the computation framework of emerging Sensor Networks, Peer-to-Peer Networks and Vehicular Networks. We present the Threshold Join Algorithm (TJA), an efficient algorithm that utilizes a non-uniform threshold on the queried attribute in order to minimize the transfer of data when a query is executed. Additionally, TJA resolves queries in the network rather than in a centralized fashion which further minimizes the consumption of bandwidth and delay. We performed an extensive experimental evaluation of our algorithm using a real testbed of 75 workstations along with a trace-driven experimental methodology. Our results indicate that TJA requires an order of magnitude less communication than the state-of-the-art, scales well with respect to the parameter k and the network topology. © 2009 Elsevier B.V. All rights reserved.en
dc.sourceComputer Networksen
dc.subjectInformation retrievalen
dc.subjectSensor networksen
dc.subjectAd hoc networksen
dc.subjectDistributed networksen
dc.subjectElectric network topologyen
dc.subjectNetwork topologiesen
dc.subjectQuery processingen
dc.subjectArts computingen
dc.subjectClient server computer systemsen
dc.subjectPeer-to-peer networksen
dc.subjectVehicular networksen
dc.subjectTest bedsen
dc.subjectExperimental evaluationsen
dc.subjectCost metricen
dc.subjectDistributed Top-K query processingen
dc.subjectEfficient algorithmsen
dc.subjectExperimental methodologiesen
dc.subjectJoin algorithmsen
dc.subjectMulti hopsen
dc.subjectOrder of magnitudesen
dc.subjectP2P networksen
dc.subjectTop-k queriesen
dc.titleFinding the K highest-ranked answers in a distributed networken
dc.description.endingpage1449 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notes<p>Cited By :5</p>en
dc.contributor.orcidZeinalipour-Yazdi, Constantinos D. [0000-0002-8388-1549]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record