Sciweavers

467 search results - page 16 / 94
» Processing top k queries from samples
Sort
View
ISPDC
2010
IEEE
13 years 7 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
DMSN
2005
ACM
13 years 11 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 10 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
EDBTW
2004
Springer
14 years 2 months ago
Continuous Query Processing in Spatio-Temporal Databases
In this paper, we aim to develop a framework for continuous query processing in spatio-temporal databases. The proposed framework distinguishes itself from other query processors b...
Mohamed F. Mokbel
CIKM
2005
Springer
14 years 2 months ago
Retrieving answers from frequently asked questions pages on the web
We address the task of answering natural language questions by using the large number of Frequently Asked Questions (FAQ) pages available on the web. The task involves three steps...
Valentin Jijkoun, Maarten de Rijke