By Topic

An approximate L1-difference algorithm for massive data streams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Feigenbaum, J. ; AT&T Res. Labs., Florham Park, NJ, USA ; Kannan, S. ; Strauss, M. ; Viswanathan, M.

We give a space-efficient, one-pass algorithm for approximating the L1 difference Σi|ai-bi | between two functions, when the function values ai and bi are given as data streams, and their order is chosen by an adversary. Our main technical innovation is a method of constructing families {Vj} of limited independence random variables that are range summable by which we mean that Σj=0 c-1 Vj(s) is computable in time polylog(c), for all seeds s. These random variable families may be of interest outside our current application domain, i.e., massive data streams generated by communication networks. Our L1-difference algorithm can be viewed as a “sketching” algorithm, in the sense of (A. Broder et al., 1998), and our algorithm performs better than that of Broder et al., when used to approximate the symmetric difference of two sets with small symmetric difference

Published in:

Foundations of Computer Science, 1999. 40th Annual Symposium on

Date of Conference:

1999