Sciweavers

301 search results - page 1 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
63
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 11 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
16 years 15 days ago
Sketch-Based Summarization of Ordered XML Streams
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
Veronica Mayorga, Neoklis Polyzotis
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 4 days ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
91
Voted
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 4 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
PODS
2007
ACM
225views Database» more  PODS 2007»
15 years 11 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...