Fast and approximate stream mining of quantiles and frequencies using graphics processors

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 611-622

  Govindaraju, Naga K ^a   Raghuvanshi, Nikunj ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Data streams; Frequencies; Graphics processors; Memory bandwidth; Quantiles; Sliding windows; Sorting

Indexed keywords

DATA STREAMS; GRAPHICS PROCESSORS; MEMORY BANDWIDTH; QUANTILES; SLIDING WINDOWS;

APPROXIMATION THEORY; BANDWIDTH; COMPUTATION THEORY; DATA COMMUNICATION EQUIPMENT; DATA STRUCTURES; LEARNING ALGORITHMS; PROGRAM PROCESSORS;

DATA MINING;

EID: 29844438097     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066227     Document Type: Conference Paper

References (47)

1. P. Agarwal, S. Krishnan, N. Mustafa, and S. Venkatasubramanian. Streaming geometric optimization using graphics hardware, 11 European Symposium on Algorithms, 2003.
2. Ramesh C. Agarwal. A super scalar sort algorithm for RISC processors. SIGMOD Record (ACM Special Interest Group on Management of Data), 25(2):240-246, June 1996.
3. G. Aggarwal, M. Datar, S. Rajagopalan, and M. Ruhl. On the streaming model augmented with a sorting primitive. Proc. of FOCS, 2004.
4. R. Ananthakrishna, A. Das, J. Gehrke, F. Korn, S. Muthukrishnan, and D. Srivastava, Efficient approximation of correlated sums on data streams, IEEE Trans. on Knowledge and Data Engineering, pages 569-572, 2003.
5. A. Arasu, B. Babcock, S. Babu, J. Cieslewicz, M. Datar, K. Ito, R. Motwani, U. Srivastava, and J. Widom. Stanford data stream management system. Data Stream Management, 2004. To appear.
6. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows, PODS, 2004.
7. N. Bandi, C. Sun, D. Agrawal, and A. El Abbadi. Hardware acceleration in commercial databases: A case study of spatial operations. VLDB, 2004.
8. K. E. Batcher. Sorting networks and their applications. In Proc. 1968 Spring Joint Computer Conf., pages 307-314, Reston, VA, 1968. AFIPS Press.
9. I. Buck, T. Foley, D. Horn, J. Sugerman, K. Fatahalian, M. Houston, and P. Hanrahan. Brook for gpus: Stream computation on graphics hardware. Proc. of ACM SIGGRAPH, 2004.
10. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Proc. of the 29th ICALP, 2002.
11. Surajit Chaudhuri, Rajeev Motwani, and Vivek Narasayya. Random sampling for histogram construction: How much is enough? SIGMOD Record (ACM Special Interest Group on Management of Data), 27(2):436-447, June 1998.
12. Graham Cormode and S. Muthukrishnan. What's hot and what's not: tracking most frequent items dynamically. In ACM, editor, Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 2003: San Diego, Calif., June 9-11, 2003, pages 296-306, New York, NY 10036, USA, 2003, ACM Press, ACM order number 475030.
13. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. Proc. of 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 635-644, 2002.
14. E. Demaine, A. Lopez-Ortiz, and J. Munro. Frequency estimation of internet packet streams with limited space. Proc. of 10th Annual European Symposium on Algorithms, pages 348-360, 2002.
15. Michael Doggett. Programmability features of graphics hardware, ACM SIGGRAPH Course Notes # 11, 2003.
16. M. Dowd, Y. Perl, L. Rudolpg, and M. Saks. The periodic balanced sorting network, Journal of the ACM, pages 738-757, 1989.
17. Alain Fournier and Donald Fussell. On the power of the frame buffer, ACM Transactions on Graphics, 7(2): 103-128, 1988.
18. C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu, Mining frequent patterns in data streams at multiple time granularities, Proc. of NSF Workshop on Next Generation Data Mining, 2002.
19. N. Govindaraju, M. Henson, M. Lin, and D. Manocha, Interactive visibility ordering of geometric primitives in complex environments, Proc. of ACM Interactive 3D Graphics and Games, 2005.
20. N. Govindaraju, B. Lloyd, W. Wang, M. Lin, and D. Manocha. Fast computation of database operations using graphics processors. Proc. of ACM SIGMOD, 2004.
21. N. Govindaraju, N. Raghuvanshi, M. Henson, and D. Manocha. A cache-efficient sorting algorithm for database and data mining computations using graphics processors. Technical report, University of North Carolina-Chapel Hill, 2005.
22. M. Greenwald and S. Khanna. Power-conserving computation of order-statistics over sensor networks. PODS, 2004.
23. Michael Greenwald and Sanjeev Khanna. Space-efficient online computation of quantile summaries, SIGMOD Record (ACM Special Interest Group on Management of Data), 30(2):58-66, June 2001.
24. S. Guha and N. Koudas. Approximating a data stream for querying and estimation: Algorithms and performance evaluation. Proc. of the 18th International Conference on Data Engineering, 2002.
25. P. Indyk. Algorithms for dynamic geometric problems over data streams. Proc. of STOC, pages 373-380, 2004.
26. C. Jin, W. Qian, C. Sha, J. Yu, and A. Zhou. Dynamically maintaining frequent items over a data stream. Conference on Information and Knowledge Management, 2003.
27. R. Jin and G. Agrawal. An algorithm for in-core frequent itemset mining on streaming data. Submitted for Publication, 2004.
28. R. Karp, S. Shenker, and C. Papadimitriou, A simple algorithm for finding frequent elements in streams and bags. ACM Trans, on Database Systems, 28(1):51-55, 2003.
29. P. Kipfer, M. Segal, and R. Westermann. Uberflow: A gpu-based particle engine. SIGGRAPH/Eurographics Workshop on Graphics Hardware, 2004.
30. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
31. A. LaMarca and R. Ladner. The influence of caches on the performance of sorting. Proc. of SODA, pages 370-379, 1997.
32. A. Lastra, M. Lin, and D. Manocha. GPGP: General purpose computation using graphics processors. http://www.cs.unc.edu/Events/Conferences/GP2, 2004.
33. X. Lin, H. Lu, J. Xu, and J. X. Xu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. Proc. of 20th Int. Conf. on Data Engineering, 2004.
34. Gurmeet Singh Manku and Rajeev Motwani. Approximate frequency counts over data streams. In Philip A. Bernstein et al., editors, VLDB 2002: proceedings of the Twenty-Eighth International Conference on Very Large Data Bases, Hong Kong, pages 346-357, 2002.
35. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. SIGMOD Record (ACM Special Interest Group on Management of Data), 27(2):426-435, June 1998.
36. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. SIGMOD Record (ACM Special Interest Group on Management of Data), 28(2):251-262, 1999.
37. D. Manocha. Interactive Geometric and Scientific Computations using Graphics Hardware. SIGGRAPH Course Notes # 11, 2003.
38. J. Misra and D. Gries. Finding repeated elements. Sc. Comp. Prog., 2:143-152, 1982.
39. R. Motwani and D. Thomas. Caching queues in memory buffers. Proc. of SODA, 2004.
40. J. Munro and M. Paterson. Selection and sorting with limited storage. Theoretical Computer Science, pages 315-323, 1980.
41. S. Muthukrishnan. Data streams: Algorithms and applications. Proc. of 14th ACM-SIAM Symposium on Discrete Algorithms, 2003. http://athos.rutgers.edu/ muthu/stream-1-1.ps.
42. T. Purcell, C. Donner, M. Cammarano, H. Jensen, and P. Hanrahan, Photon mapping on programmable graphics hardware. ACM SIGGRAPH/Enrographics Conference on Graphics Hardware, pages 41-50, 2003.
43. C. Sun, D. Agrawal, and A. El Abbadi. Hardware acceleration for spatial selections and joins. SIGMOD, 2003.
44. N. Thaper. Dynamic multidimensional histograms. Proc. of ACM SIGMOD, 2002.
45. S. Venkatasubramanian. The graphics card as a stream computer. Workshop on Management and Processing of Data Streams, 2003.
46. J. Xu, X. Lin, and X. Zhou. Space efficient quantile summary for constrained sliding windows on a data stream, Proceedings of WAIM (LNCS 3129), pages 34-44, 2004.
47. Jingren Zhou and Kenneth A. Ross. Implementing database operations using SIMD instructions. In Michael Franklin, Bongki Moon, and Anastassia Ailamaki, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, June 3-6, 2002, Madison, WI, USA, pages 145-156, New York, NY 10036, USA, 2002. ACM Press, ACM order number 475020.