Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
INFOCOM
2011
IEEE
10 years 5 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
DMSN
2005
ACM
11 years 3 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...
VLDB
1999
ACM
127views Database» more  VLDB 1999»
11 years 5 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
MDM
2010
Springer
180views Communications» more  MDM 2010»
11 years 6 months ago
Online Time Interval Top-k Queries in Wireless Sensor Networks
Motivated by many applications, top-k query is a fundamental operation in modern database systems. Technological advances have enabled the deployment of large-scale sensor networks...
Baichen Chen, Weifa Liang, Jeffrey Xu Yu
VLDB
2007
ACM
124views Database» more  VLDB 2007»
11 years 7 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
11 years 7 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi
BTW
2007
Springer
142views Database» more  BTW 2007»
11 years 7 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
12 years 1 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
12 years 2 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
books