Estimating simple functions on the union of data streams

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 281-290

  Gibbons, P B ^a   Tirthapura, S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROGRAM PROCESSORS;

DATA STREAMS; DETERMINISTIC ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0034832662     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378687     Document Type: Conference Paper

References (26)

1. The Aqua approximate query answering system
2. Join synopses for approximate query answering
3. Tracking algorithms for join and self-join sizes
4. The space complexity of approximating the frequency moments
5. Min-wise independent permutations
6. Towards estimation error guarantees for distinct values
7. Size-estimation framework with applications to transitive closure and reachability
8. 1-difference algorithm for massive data streams
9. Probabilistic counting algorithms for data base applications
10. p-difference algorithm for massive data streams
11. New sampling-based summary statistics for improving approximate query answers
12. Synopsis data structures for massive data sets
13. Clustering data streams
14. Sampling-based estimation of the number of distinct values of an attribute
15. Stable distributions, pseudorandom generators, embeddings and data stream computation
16. Identifying representative trends in massive time series datasets using sketches
17. On randomized one-round communication complexity
18. Private vs. common random bits in communication complexity
19. Public vs. private coin flips in one round communication games
20. A linear-time probabilistic counting algorithm for database applications