1. Duplicate Detection in Click Streams(2005) SubtitleAhmed Metwally Divyakant Agrawal Amr El Abbadi Tian Wang

2. Goal of the paper Detect Duplicate click. Approach Sliding window, Landmark window, Jumping windows. Bloom Filters Algorithm.

3. Sliding Windows Query latest N click in the stream. Queue Structure 123456 123456

4. Landmark windows Handle disjoint portion of data streams. Landmarks: time or number. Space saving vs. Cross Windows 8:009:0010:0011:0012:0013:00 1,2,3,45,6,7,89,10,1111,12,1313,14,1516,17,18 50clicks

5. Jumping windows Compromise between landmark windows and sliding windows. Maintain n sub-windows. Populate the latest sub-window and delete the eldest sub- window.

6. Algorithm for checking the duplicate clicks Basic approach Scan the entire window and compare. Window of size N requires O(N2) comparisons. Basic approach with index Reduce the search cost to O(log(N)) per element. Increase the element insertion cost to O(log(N)). Goal of new algorithm Detect all duplicate. Less space. Quick processing. Few false positive error.

7. Bit Vector Algorithm Assume unique click with 32bits. Keep a bit vector of length 2^32 bits. 0…..0(32) ------- 1….1(32) takes O(1) steps and space to insert a new element into the bit vector, or to check it for duplication. Disadvantage: a larger click with 512 bit.

8. Bit Vector Algorithm(modification) Keep partial information p bits, 1 ≤ p ≤ b, b is the length of a vector The nth bit vector has bits for all the combinations of bits (n−1)... (n+p−2). There are b−p+1 bit vectors utilized. Bits used:

9. Potential Problems Probabilistic analysis Any two elements picked at random have a probability of 2^−p that they will collide in any bit vector of length p. a, and b have the same values in bits (n−1) to (n+p−2), then there is a probability of 1/2 that the values of the bits starting at n to (n+p−1) will be equal. Goal Achieve better result. Facilitate the probabilistic analysis.

10. Bloom Filter General idea Two set X Y, check every element belong to Y. O(|X|) operations, and O(|Y|) space Data Structure Array of M cells. Element y using d independent hash function to addresses y1, y2,..., yd, which are set to 1, such that 0 ≤ yi ≤ M − 1, ∀ i. X use same hash manner. If all set to 1, there is a good probability that x ∈ Y.

11. Bloom Filter for Duplicate Detection test every new element on the Bloom Filter structure of the previously observed elements, and then insert it into the Bloom Filter structure. The element is not counted as a duplicate if at least 1 bit was switched from 0 to 1, and is considered to be a duplicate otherwise.

12. Bloom Filter for Sliding Windows Counting Bloom Filters. Delete expired element. Use an integer in a cell represents the number of elements which hash to this cell.

13. Experiment Landmark and jumping windows Tradeoff between space, time and error rate. The numbers of hash function used.