
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Abhinandan Das, Johannes Gehrke, Mirek Riedewald, "Semantic Approximation of Data Stream Joins," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 1, pp. 4459, January, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.17, author = {Abhinandan Das and Johannes Gehrke and Mirek Riedewald}, title = {Semantic Approximation of Data Stream Joins}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {1}, issn = {10414347}, year = {2005}, pages = {4459}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.17}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Semantic Approximation of Data Stream Joins IS  1 SN  10414347 SP44 EP59 EPD  4459 A1  Abhinandan Das, A1  Johannes Gehrke, A1  Mirek Riedewald, PY  2005 KW  Data streams KW  approximation algorithms KW  semantic load shedding KW  set approximation error metrics KW  join processing. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. PrenticeHall, 1993.
[2] A. Arasu, B. Babcock, S. Babu, J. McAlister, and J. Widom, “Characterizing Memory Requirements for Queries over Continuous Data Streams,” Proc. Symp. Principles of Database Systems (PODS), pp. 221232, 2002.
[3] B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, “Models and Issues in Data Stream Systems,” Proc. Symp. Principles of Database Systems (PODS), pp. 116, 2002.
[4] S. Babu and J. Widom, “Continuous Queries over Data Streams,” ACM SIGMOD Record, vol. 30, no. 3, pp. 109120, 2001.
[5] D. Barbará, W. DuMouchel, C. Faloutsos, P.J. Haas, J.M. Hellerstein, Y.E. Ioannidis, H.V. Jagadish, T. Johnson, R.T. Ng, V. Poosala, K.A. Ross, and K.C. Sevcik, “The New Jersey Data Reduction Report,” IEEE Data Eng. Bull., vol. 20, no. 4, pp. 345, 1997.
[6] P. Bonnet, J. Gehrke, and P. Seshadri, “Towards Sensor Database Systems,” Proc. Int'l Conf. Mobile Data Management (MDM), pp. 314, 2001.
[7] D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, and S. Zdonik, “Monitoring Streams— A New Class of Data Management Applications,” Proc. Int'l Conf. Very Large Databases (VLDB), 2002.
[8] S. Chandrasekaran and M.J. Franklin, “Streaming Queries over Streaming Data,” Proc. Int'l Conf. Very Large Databases (VLDB), 2002.
[9] S. Chaudhuri, R. Motwani, and V.R. Narasayya, “On Random Sampling over Joins,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 263274, 1999.
[10] J. Chen, D.J. DeWitt, F. Tian, and Y. Wang, “NiagaraCQ: A Scalable Continuous Query System for Internet Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 379390, 2000.
[11] C.D. Cranor, Y. Gao, T. Johnson, V. Shkapenyuk, and O. Spatscheck, “Gigascope: High Performance Network Monitoring with an SQL Interface,” Proc. ACM SIGMOD Int'l Conf. Management of Data, p. 623, 2002.
[12] A. Das, J. Gehrke, and M. Riedewald, “Approximate Join Processing over Data Streams,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4051, 2003.
[13] A. Das, J. Gehrke, and M. Riedewald, “Semantic Approximation of Data Stream Joins,” Technical Report TR20041932, Cornell Univ., 2004, http:/techreports.library.cornell.edu.
[14] A. Das, J. Gehrke, and M. Riedewald, “Semantic Approximation of Data Stream Joins (supplementary material),” CS Digital Library, available at http://computer.org/tkdearchives.htm, 2004.
[15] M. Datar, A. Gionis, P. Indyk, and R. Motwani, “Maintaining Stream Statistics over Sliding Windows,” Proc. ACMSIAM Symp. Discrete Algorithms (SODA), pp. 635644, 2002.
[16] A. Dobra, M.N. Garofalakis, J. Gehrke, and R. Rastogi, “Processing Complex Aggregate Queries over Data Streams,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 6172, 2002.
[17] M.N. Garofalakis, J. Gehrke, and R. Rastogi, “Querying and Mining Data Streams: You Only Get One Look, Proc. ACM SIGMOD Int'l Conf. Management of Data, 2002.
[18] IEEE Data Eng. Bull., special issue on data stream processing, J. Gehrke, ed., vol. 26, 2003.
[19] A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss, “Surfing Wavelets on Streams: OnePass Summaries for Approximate Aggregate Queries,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 7988, 2001.
[20] A.V. Goldberg, “An Efficient Implementation of a Scaling MinimumCost Flow Algorithm,” J. Algorithms, vol. 22, no. 1, pp. 129, 1997.
[21] M. Greenwald and S. Khanna, “SpaceEfficient Online Computation of Quantile Summaries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 5865, 2001.
[22] S. Guha, N. Koudas, and K. Shim, “DataStreams and Histograms,” Proc. ACM Symp. Theory of Computing (STOC), pp. 471475, 2001.
[23] C.J. Hahn, S.G. Warren, and J. London, “Edited Synoptic Cloud Reports from Ships and Land Stations over the Globe,” 19821991, http://cdiac.esd.ornl.gov/ftpndp026b, 1996.
[24] M.A. Hammad, M.J. Franklin, W.G. Aref, and A.K. Elmagarmid, “Scheduling for Shared Window Joins over Data Streams,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 297308, 2003.
[25] D. Hand, H. Mannila, and P. Smyth, Principles of Data Mining. MIT Press, 2001.
[26] J.M. Hellerstein, M.J. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, and M.A. Shah, “Adaptive Query Processing: Technology in Evolution,” IEEE Data Eng. Bull., vol. 23, no. 2, pp. 718, 2000.
[27] Y. E. Ioannidis and V. Poosala, “HistogramBased Approximation of SetValued QueryAnswers,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 174185, 1999.
[28] Z.G. Ives, D. Florescu, M. Friedman, A.Y. Levy, and D.S. Weld, “An Adaptive Query Execution System for Data Integration,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 299310, 1999.
[29] J. Kang, J.F. Naughton, and S.D. Viglas, “Evaluating Window Joins over Unbounded Streams,” Proc. Int'l Conf. Data Eng. (ICDE), 2003.
[30] F. Korn, S. Muthukrishnan, and D. Srivastava, “Reverse Nearest Neighbor Aggregates over Data Streams,” Proc. Int'l Conf. Very Large Databases (VLDB), 2002.
[31] S. Madden and M.J. Franklin, “Fjording the Stream: An Architecture for Queries over Streaming Sensor Data,” Proc. Int'l Conf. Data Eng. (ICDE), 2002.
[32] S.R. Madden, M.A. Shah, J.M. Hellerstein, and V. Raman, “Continuously Adaptive Continuous Queries over Streams,” Proc. ACM SIGMOD Int'l Conf. Management of Data, 2002.
[33] R. Ramakrishnan and J. Gehrke, Database Management Systems, third ed. McGrawHill, 2003.
[34] R.T. Rockafellar, Network Flows and Monotropic Optimization. John Wiley & Sons, 1984.
[35] Y. Rubner, C. Tomasi, and L.J. Guibas, “A Metric for Distributions with Applications to Image Databases,” Proc. Int'l Conf. Computer Vision (ICCV), pp. 207214, 1998.
[36] M.A. Shah, J.M. Hellerstein, S. Chandrasekaran, and M.J. Franklin, “Flux: An Adaptive Partitioning Operator for Continuous Query Systems,” Proc. Int'l Conf. Data Eng. (ICDE), pp. 2536, 2003.
[37] N. Tatbul, U. Çetintemel, S. Zdonik, M. Cherniack, and M. Stonebraker, “Load Shedding in a Data Stream Manager,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 309320, 2003.
[38] Stanford STREAM Team, Stream Query Repository, http://wwwdb.stanford.edu/streamsqr, 2004.
[39] N. Thaper, S. Guha, P. Indyk, and N. Koudas, “Dynamic Multidimensional Histograms,” Proc. ACM SIGMOD Int'l Conf. Management of Data, 2002.
[40] C.J. van Rijsbergen, Information Retrieval, second ed. Butterworths, 1979.
[41] S.D. Viglas, J. Burger, and J.F. Naughton, “Maximizing the Output Rate of MultiWay Join Queries over Streaming Information Sources,” Proc. Int'l Conf. Very Large Databases (VLDB), pp. 285296, 2003.