Sciweavers

725 search results - page 32 / 145
» Approximate Join Processing Over Data Streams
Sort
View
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 3 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 6 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
PVLDB
2010
84views more  PVLDB 2010»
13 years 7 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
14 years 10 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 8 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...