Tracking set-expression cardinalities over continuous update streams

VLDB Journal

Volumn 13, Issue 4, 2004, Pages 354-369

  Ganguly, Sumit ^a,b   Garofalakis, Minos ^a   Rastogi, Rajeev ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Approximate query processing; Data streams; Data synopses; Randomized algorithms; Set expressions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; ESTIMATION; INTERNET; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; QUERY LANGUAGES;

APPROXIMATE QUERY PROCESSING; DATA STREAMS; DATA SYNOPSES; RANDOMIZED ALGORITHMS; SET EXPRESSION;

DATA PROCESSING;

EID: 10644246980     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-004-0135-3     Document Type: Article

References (31)

1. Alon N, Gibbons PB, Matias Y, Szegedy M (1999) Tracking join and self-join sizes in limited storage. In: Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Philadeplphia
2. Alon N, Matias Y, Szegedy M (1996) The space complexity of approximating the frequency moments. In: Proceedings of the 28th annual ACM symposium on the theory of computing, Philadelphia, pp 20-29
3. Alon N, Spencer JH (1992) The probabilistic method. Wiley, New York
4. Bar-Yossef Z, Jayram TS, Kumar R, Sivakumar D, Trevisan L (2002) Counting distinct elements in a data stream. In: Proceedings of the 6th international workshop on randomization and approximation techniques in computer science (RANDOM'02), Cambridge, MA
5. Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations. In: Proceedings of the 30th ACM symposium on the theory of computing, pp 327-336
6. Charikar M, Chaudhuri S, Motwani R, Narasayya V (2000) Towards estimation error guarantees for distinct values. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Dallas, TX
7. Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: Proceedings of the international colloquium on automata, languages, and programming, Malaga, Spain
8. Chen Z, Korn F, Koudas N, Muthukrishnan S (2000) Selectivity estimation for Boolean queries. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Dallas, TX
9. Cohen E (1997) Size-estimation framework with applications to transitive closure and reachability. J Comput Sys Sci 55(3):441-453
10. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT Press, Cambridge, MA
11. Dobra A, Garofalakis M, Gehrke J, Rastogi R (2002) Processing complex aggregate queries over data streams. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, WI, pp 61-72
12. 1-difference algorithm for massive data streams. In: Proceedings of the 40th IEEE symposium on foundations of computer science, pp 501-511
13. 1-difference algorithm for massive data streams. In: Proceedings of the 40th annual IEEE symposium on foundations of computer science, New York
14. Flajolet P, Martin GN (1985) Probabilistic counting algorithms for data base applications. J Comput Sys Sci 31:182-209
15. Ganguly S, Garofalakis M, Rastogi R (2003) Processing set expressions over continuous update streams. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, San Diego, CA
16. Garofalakis M, Gibbons PB (2001) Approximate query processing: taming the terabytes. Tutorial in: 27th international conference on very large data bases, Rome, Italy
17. Garofalakis M, Gehrke J, Rastogi R (2002) Querying and mining data streams: you only get one look. Tutorial in: 28th international conference on very large data bases, Hong Kong
18. Gibbons PB (2001) Distinct sampling for highly-accurate answers to distinct values queries and event reports. In: Proceedings of the 27th international conference on very large data bases, Rome, Italy
19. Gibbons PB, Tirthapura S (2001) Estimating simple functions on the union of data streams. In: Proceedings of the 13th annual ACM symposium on parallel algorithms and architectures, Crete Island, Greece
20. Gilbert AC, KotidisY, Muthukrishnan S, Strauss MJ (2001) Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In: Proceedings of the 27th international conference on very large data bases, Rome, Italy
21. Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ (2002) How to summarize the universe: dynamic maintenance of quantiles. In: Proceedings of the 28th international conference on very large data bases, pp 454-465, Hong Kong
22. Greenwald M, Khanna S (2001) Space-efficient online computation of quantile summaries. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, Santa Barbara, CA
23. Haas PJ, Naughton JF, Seshadri S, Stokes L (1995) Sampling-based estimation of the number of distinct values of an attribute. In: Proceedings of the 21 st international conference on very large data bases, pp 311-322
24. Indyk P (1999) A small approximately min-wise independent family of hash functions. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, pp 454-456
25. Indyk P (2000) Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 41st annual IEEE symposium on foundations of computer science, Redondo Beach, CA, pp 189-197
26. Kalyanasundaram B, Schnitger G (1992) The probabilistic communication complexity of set intersection. SIAM J Discrete Math 5(4):545-557
27. Kushilevitz E, Nisan N (1997) Communication complexity. Cambridge University Press, Cambridge, UK
28. Singh Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases, Hong Kong, pp 346-357
29. Melton J, Simon AR (1993) Understanding the new SQL: a complete guide. Morgan Kaufmann, San Francisco
30. Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, Cambridge, UK
31. Thaper N, Guha S, Indyk P, Koudas N (2002) Dynamic multidimensional histograms. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, WI, pp 428-439