Sciweavers

494 search results - page 37 / 99
» Approximate continuous querying over distributed streams
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 28 days ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
16 years 1 months ago
ICEDB: Intermittently-Connected Continuous Query Processing
Current distributed database and stream processing systems assume that the network connecting nodes in the data processor is "always on," and that the absence of a netwo...
Yang Zhang, Bret Hull, Hari Balakrishnan, Samuel M...
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
EDBT
2006
ACM
136views Database» more  EDBT 2006»
15 years 12 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 3 days ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim