Join-distinct aggregate estimation over update streams

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2005, Pages 259-270

  Ganguly, Sumit ^a   Garofalakis, Minos ^b   Kumar, Amit ^c   Rastogi, Rajeev ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b LUCENT TECHNOLOGIES   (United States)

^c INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMS; JOIN-SIZE ESTIMATION; NETWORK-MONITORING APPLICATION;

ALGORITHMS; COMPUTER NETWORKS; QUERY LANGUAGES;

DATABASE SYSTEMS;

EID: 33244460810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065200     Document Type: Conference Paper

References (21)

1. Noga Alon, Phillip B. Gibbons, Yossi Matias, and Mario Szegedy. "Tracking Join and Self-Join Sizes in Limited Storage". In Proc. of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, May 1999.
2. Noga Alon, Yossi Matias, and Mario Szegedy. "The Space Complexity of Approximating the Frequency Moments". In Proc. of the 28th Annual ACM Symposium on the Theory of Computing, pages 20-29, Philadelphia, Pennsylvania, May 1996.
3. Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. "Counting distinct elements in a data stream". In Proc. of the 6th Intl. Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'02), Cambridge, Massachusetts, September 2002.
4. Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, and Vivek Narasayya. "Towards Estimation Error Guarantees for Distinct Values". In Proc. of the 19th ACM Symposium on Principles of Database Systems, Dallas, Texas, May 2000.
5. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. "Introduction to Algorithms". MIT Press (The MIT Electrical Engineering and Computer Science Series), 1990.
6. Alin Dobra, Minos Garofalakis, Johannes Gehrke, and Rajeev Rastogi. "Processing Complex Aggregate Queries over Data Streams". In Proc. of the 2002 ACM SIGMOD Intl. Conference on Management of Data, pages 61-72, Madison, Wisconsin, June 2002.
7. Philippe Flajolet and G. Nigel Martin. "Probabilistic Counting Algorithms for Data Base Applications". Journal of Computer and Systems Sciences, 31:182-209, 1985.
8. Sumit Ganguly, Minos Garofalakis, Amit Kumar, and Rajeev Rastogi. "Join-Distinct Aggregate Estimation over Update Streams". Bell Labs Technical Memorandum, March 2005.
9. Sumit Ganguly, Minos Garofalakis, and Rajeev Rastogi. "Tracking Set-Expression Cardinalities over Continuous Update Streams". The VLDB Journal, 13(4):354-369, December 2004. (Special Issue on Data Stream Processing).
10. Phillip B. Gibbons. "Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports". In Proc. of the 27th Intl. Conference on Very Large Data Bases, Roma, Italy, September 2001.
11. Phillip B. Gibbons and Srikanta Tirthapura. "Estimating Simple Functions on the Union of Data Streams". In Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Crete Island, Greece, July 2001.
12. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. "Fast, small-space algorithms for approximate histogram maintenance". In Proc. of the 34th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, May 2002.
13. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. "Surfing Wavelets on Streams: One-pass Summaries for Approximate Aggregate Queries". In Proc. of the 27th Intl. Conference on Very Large Data Bases, Roma, Italy, September 2001.
14. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss. "How to Summarize the Universe: Dynamic Maintenance of Quantiles". In Proc. of the 28th Intl. Conference on Very Large Data Bases, pages 454-465, Hong Kong, China, August 2002.
15. P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In Proc. 21st International Conf. on Very Large Data Bases, pages 311-322, September 1995.
16. Piotr Indyk. "Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation". In Proc. of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 189-197, Redondo Beach, California, November 2000.
17. Bala Kalyanasundaram and Georg Schnitger. "The Probabilistic Communication Complexity of Set Intersection". SIAM Journal on Discrete Mathematics, 5(4):545-557, November 1992.
18. Eyal Kushilevitz and Noam Nisan. "Communication Complexity". Cambridge University Press, 1997.
19. Rudolf Lidl and Harald Niederreiter. "Introduction to Finite Fields and their Applications". Cambridge University Press, 1994. (Second Edition).
20. Jim Melton and Alan R. Simon. "Understanding the New SQL: A Complete Guide". Morgan Kaufmann Publishers, 1993.
21. Rajeev Motwani and Prabhakar Raghavan. "Randomized Algorithms". Cambridge University Press, 1995.