Sciweavers

606 search results - page 35 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
VLDB
1999
ACM
133views Database» more  VLDB 1999»
15 years 4 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
ICDCSW
2007
IEEE
15 years 6 months ago
Using stream queries to measure communication performance of a parallel computing environment
We have developed a data stream management system that supports declarative stream queries running over high data volumes in a supercomputing environment. To enable specification ...
Erik Zeitler, Tore Risch
IPPS
2005
IEEE
15 years 5 months ago
A Parallel Algorithm for Correlating Event Streams
This paper describes a parallel algorithm for correlating or “fusing” streams of data from sensors and other sources of information. The algorithm is useful for applications w...
Daniel M. Zimmerman, K. Mani Chandy
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 4 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
OTM
2005
Springer
15 years 5 months ago
Event Broker Grids with Filtering, Aggregation, and Correlation for Wireless Sensor Data
Abstract. A significant increase in real world event monitoring capability with wireless sensor networks brought a new challenge to ubiquitous computing. To manage high volume and...
Eiko Yoneki