Sciweavers

494 search results - page 50 / 99
» Approximate continuous querying over distributed streams
Sort
View
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
13 years 14 days ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 9 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
DBPL
2003
Springer
92views Database» more  DBPL 2003»
14 years 2 months ago
A Query Algebra for Fragmented XML Stream Data
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast ...
Sujoe Bose, Leonidas Fegaras, David Levine, Vamsi ...
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 11 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
PVLDB
2008
116views more  PVLDB 2008»
13 years 9 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan