Sciweavers

1171 search results - page 128 / 235
» Streaming Queries over Streaming Data
Sort
View
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 11 months ago
Network-Aware Operator Placement for Stream-Processing Systems
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple...
Peter R. Pietzuch, Jonathan Ledlie, Jeffrey Shneid...
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 10 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
CCCG
2006
13 years 11 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
Hamid Zarrabi-Zadeh, Timothy M. Chan
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 11 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 5 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...