Sciweavers

734 search results - page 29 / 147
» Efficient join processing over uncertain data
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
15 years 10 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
137
Voted
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
15 years 9 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
15 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
15 years 11 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
152
Voted
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
15 years 9 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...