Sciweavers

241 search results - page 17 / 49
» Estimating statistical aggregates on probabilistic data stre...
Sort
View
WWW
2008
ACM
15 years 4 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 9 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
IPSN
2004
Springer
15 years 9 months ago
Loss inference in wireless sensor networks based on data aggregation
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...
Gregory Hartl, Baochun Li
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 4 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi