Fast Top-K Query Answering

Dabringer, Claus; Eder, Johann

doi:10.1007/978-3-642-23091-2_14

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2017

Publication Types

Select...

Book2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Top-k queries are also popular for providing users ranked search results they are used from web search engines. Top-k queries, in particular, the optimization of top-k query processing for central databases received a lot of attention [3,5,8,9,18,19,20,21,23,26]. Optimizing top-k queries in distributed environment, in particular in highly distributed networks of federated or peer to peer databases still has significant research needs.…”

Section: Introductionmentioning

confidence: 99%

Towards Adaptive Distributed Top-k Query Processing

Dabringer

Eder

2016

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

ADiT is an adaptive approach for processing distributed topk queries over peer-to-peer networks optimizing both system load and query response time. This approach considers the size of the peer to peer network, the amount k of searched objects, the network capabilities of a connected peer, i.e. the transmission rate, the amount of objects stored on each peer, and the speed of a peer in processing a local topk query. In extensive experiments with a variety of scenarios we could show that ADiT outperforms state of the art distributed query processing techniques.

show abstract