An approximate L1-difference algorithm for massive data streams

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 131-151

  Feigenbaum, Joan ^a   Kannan, Sampath ^b   Strauss, Martin J ^c   Viswanathan, Mahesh ^d  

^a Yale University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d University of Illinois at Urbana Champaign   (United States)

Author keywords

Distance approximation; Streaming algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; MARKETING;

DISTANCE APPROXIMATION; PRODUCT MARKETING; STREAMING ALGORITHMS;

DIFFERENCE EQUATIONS;

EID: 0037943836     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799361701     Document Type: Article

References (13)

1. N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, J. Comput. System Sci., 58 (1999), pp. 137-147.
2. N. Alon, P. Gibbons, Y. Matias, and M. Szegedy, Tracking join and self-join sizes in limited storage, in Proceedings of the 18th Symposium on Principles of Database Systems, ACM, New York, 1999, pp. 10-20.
3. N. Alon and J. Spencer, The Probabilistic Method, John Wiley, New York, 1992.
4. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Min-wise independent permutations, J. Comput. System Sci., 60 (2000) pp. 630-659.
5. A. Broder, S. Glassman, M. Manasse, and G. Zweig, Syntactic clustering of the Web, in Proceedings of the Sixth International World Wide Web Conference, Santa Clara, CA, World Wide Web Consortium, Cambridge, MA, 1997, pp. 391-404 Also available online from http://www.scope.gmd.de/info/www6/technical/paper205/paper205.html.
6. Cisco NetFlow, 1998. Available online from http://www.cisco.com/warp/public/732/netflow/.
7. E. Cohen, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
8. P. Flajolet and G. N. Martin, Probabilistic counting, in Proceedings of the 24th Foundations of Computer Science Conference, IEEE Computer Society, Los Alamitos, 1983, pp. 76-82.
9. P. Gibbons and Y. Matias, Synopsis Data Structures for Massive Data Sets, in Eternal Memory Algorithms, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 50, AMS, Providence, RI, 1999, pp. 39-70.
10. M. R. Henzinger, P. Raghavan, and S. Rajagopalan, Computing on Data Streams, Technical Report 1998-011, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, 1998.
11. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, Cambridge, UK, 1997.
12. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Math. Library 16, North Holland, New York, 1977.
13. E. Rains and N. J. A. Sloane, Private communication.