Zobrazit v EDS

Finding the K Highest-Ranked Answers in a Distributed Network

Uloženo v:
Podrobná bibliografie
Název: Finding the K Highest-Ranked Answers in a Distributed Network
Autoři: Demetrios Zeinalipour-Yazti, Zografoula Vagena
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf.
Rok vydání: 2009
Sbírka: CiteSeerX
Témata: Key words, Distributed Top-K Query Processing, P2P Networks, Sensor Networks
Popis: In 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 answers; and 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.
Druh dokumentu: text
Popis souboru: application/pdf
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.9859; http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.9859
http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.81C6FF78
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.9859#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Zeinalipour-Yazti%20D
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.81C6FF78
RelevancyScore: 840
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 839.994262695313
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Finding the K Highest-Ranked Answers in a Distributed Network
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Demetrios+Zeinalipour-Yazti%22">Demetrios Zeinalipour-Yazti</searchLink><br /><searchLink fieldCode="AR" term="%22Zografoula+Vagena%22">Zografoula Vagena</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf</i>.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2009
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Key+words%22">Key words</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+Top-K+Query+Processing%22">Distributed Top-K Query Processing</searchLink><br /><searchLink fieldCode="DE" term="%22P2P+Networks%22">P2P Networks</searchLink><br /><searchLink fieldCode="DE" term="%22Sensor+Networks%22">Sensor Networks</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: In 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 answers; and 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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.9859; http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.9859<br />http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.81C6FF78
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.81C6FF78
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Key words
        Type: general
      – SubjectFull: Distributed Top-K Query Processing
        Type: general
      – SubjectFull: P2P Networks
        Type: general
      – SubjectFull: Sensor Networks
        Type: general
    Titles:
      – TitleFull: Finding the K Highest-Ranked Answers in a Distributed Network
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Demetrios Zeinalipour-Yazti
      – PersonEntity:
          Name:
            NameFull: Zografoula Vagena
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2009
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://www.cs.ucr.edu/%7Etsotras/functional/24.pdf
              Type: main
ResultId 1