Presentation is loading. Please wait.

Presentation is loading. Please wait.

Estimating the Sortedness of a Data Stream Parikshit GopalanU T Austin T. S. JayramIBM Almaden Robert KrauthgamerIBM Almaden Ravi KumarYahoo! Research.

Similar presentations


Presentation on theme: "Estimating the Sortedness of a Data Stream Parikshit GopalanU T Austin T. S. JayramIBM Almaden Robert KrauthgamerIBM Almaden Ravi KumarYahoo! Research."— Presentation transcript:

1 Estimating the Sortedness of a Data Stream Parikshit GopalanU T Austin T. S. JayramIBM Almaden Robert KrauthgamerIBM Almaden Ravi KumarYahoo! Research

2 Data Stream Model of Computation X 1 X 2 X 3 …X n Input Storage Computing with Massive data sets. Sequential access. Small storage space, update time. [Alon-Matias-Szegedy, …]

3 Sorting on Data-Streams Cannot sort efficiently. Can we tell if the data needs to be sorted? [Ergun-Kannan-Kumar-Rubinfeld-Vishwanathan, Ajtai-Jayram-Kumar-Sivakumar, Gupta-Zane, Cormode-Muthukrishnan-Sahinalp, LibenNowell-Vee-Zhu, Ailon-Chazelle-Commandur-Liu]

4

5

6 Sorting on Data-Streams Cannot sort efficiently on a data-stream. Can we tell if the data needs to be sorted? [Ergun-Kannan-Kumar-Rubinfeld-Vishwanathan, Ajtai-Jayram-Kumar-Sivakumar, Gupta-Zane, Cormode-Muthukrishnan-Sahinalp, LibenNowell-Vee-Zhu, Ailon-Chazelle-Commandur-Liu] Measuring distance from Sortedness: Kendall Tau distance Spearman Footrule distance Ulam distance

7 Candidate metrics 1. Spearmans footrule [ 1 distance] : e Easy to compute.

8 2. Kendall Tau distance [No. of Inversions] Inversions: Positions i (j) Candidate metrics

9 2. Kendall Tau distance [No. of Inversions] Inversions: Positions i (j) Candidate metrics

10 2. Kendall Tau distance [No. of Inversions] Candidate metrics Within a factor-2 of Spearmans footrule. [Diaconis- Graham] An O(log n) space, 1-pass (1 + ) algorithm. [Ajtai- Jayram-Kumar-Sivakumar]

11 3. Ulam distance [Edit Distance]: Ed( ): Number of deletions needed to sort. Candidate metrics Ulam: Fastest way to sort a bridge hand.

12 Ed( ): Number of deletions needed to sort Edit Distance and the LIS

13 Ed( ): Number of deletions needed to sort Delete Insert Edit Distance and the LIS

14 Ed( ) : Number of deletions needed to sort. LIS( ) : Length of the longest increasing sequence. Ed( ) + LIS( ) = n Edit Distance and the LIS Studied in statistics, biology, computer science … Both take a global view of the sequence. Hard for models like streaming, sketching, property-testing. 51 … … … 100

15 Prior Work Exact Computation of Ed( ) and LIS( ) : –Patience Sorting [Ross,Mallows]

16 Patience Sorting

17 Patience Sorting

18 Patience Sorting

19 Patience Sorting Number in place i: Earliest end to IS of length i.

20 Patience Sorting Number in place i: Earliest end to IS of length i.

21 Patience Sorting Number in place i: Earliest end to IS of length i.

22 Patience Sorting Number in place i: Earliest end to IS of length i.

23 Patience Sorting Length of LIS 0 1 LIS

24 Prior Work Exact Computation of Ed( ) and LIS( ) : –Patience Sorting [Ross,Mallows] –O(n) space, 1-pass streaming algorithm. – n) space lower bound. [LibenNowell-Vee-Zhu] Approximating Ed( ) and LIS( ) : –No sub-linear space algorithms, no lower bounds. [Ajtai et al, Cormode et al, LibenNowell et al] LIS Algorithms parametrized by length of LIS : [LibenNowell-Vee-Zhu, Sun-Woodruff] Computing Ed( ) in other models: –Property Testing [Ergun et al, Ailon et al] –Sketching [Charikar-Krauthgamer]

25 Our Results Approximating Ed( ) : –An O(log 2 n) space, randomized 4-approximation for Ed( ). –A O(n) space, deterministic (1 + ε)-approximation for Ed( ). Approximating the LIS: –A O(n) space, deterministic (1 + ε)-approximation for LIS( ). Exact Computation of Ed( ) and LIS( ): –An n) space lower bound for randomized algorithms. –Independently proved by [ Sun-Woodruff ]. Lower bounds for approximating the LIS: –Conjecture: Deterministic algorithms require n) space for (1 + ε)-approximation

26 Computing the Edit Distance Thm: For any ε > 0,there is a one-pass randomized algorithm using O(ε -2 log 2 n) space and update time, that gives a (4 + ε) approximation to Ed( ). 1. Combinatorial measure that approximates Ulam distance. Builds on [Ergun et al, Ailon et al]. 2. Sampling scheme to compute this measure in one pass.

27 A Voting Scheme [Ergun et al.] Combinatorial measure called Unpopularity. Neighborhoods of (i) : Intervals starting or ending at i

28 A Voting Scheme [Ergun et al.] Combinatorial measure called Unpopularity. Neighborhoods of (i) : Intervals starting or ending at i. Deciding if (i) is unpopular: For every neighborhood of (i) Every number in the neighborhood votes on Is (i) out of order? If majority in some neighborhood vote against (i), it is marked unpopular. Let U( ) denote no. of unpopular numbers. [Ergun et al]:Ed( ) U( ) [Ailon et al]: U( ) 2 Ed( )

29 A Voting Scheme [Ergun et al.] Can we estimate U( ) using a streaming algorithm?

30 A Voting Scheme [Ergun et al.] Can we estimate U( ) using a streaming algorithm? Impossible to decide if (i) is unpopular before seeing the entire input.

31 A New Voting Scheme Neighborhoods of (i) : Intervals ending at i. If majority in some neighborhood vote against (i), it is marked unpopular. Unpopularity based only on past, not the future. Thm: Let V( ) denote no. of unpopular numbers. Then Ed( )/2 V( ) 2 Ed( )

32 A Voting Scheme Let Ed( ) = k. Then V( ) 2k. Fix an optimal Bad set of size k to delete. How many numbers can be Unpopular ? Partition Unpopular into Good and Bad. Good numbers form an increasing sequence. Good never votes against Good. Good + Unpopular Bad neighborhood !

33 A Voting Scheme Good + Unpopular Bad neighborhood ! If k numbers are Bad, At most k are Good + Unpopular. Bad numbers might all be Unpopular. Hence V( ) 2k. Let Ed( ) = k. Then V( ) 2k. Fix an optimal Bad set of size k to delete.

34 A Voting Scheme Let Ed( ) = k. Then V( ) 2k. Bound can be tight … … … 90

35 A Voting Scheme Let V( ) = k. Then Ed( ) 2k. Fix the set of k Unpopular elements. Algorithm to produce an increasing sequence: 1.Scan right to left. 2.Delete Unpopular elements + Inversions w.r.t last number in sequence. At least half of deletions are Unpopular numbers. What remains is an increasing sequence.

36 A Voting Scheme Let V( ) = k. Then Ed( ) 2k. Bound can be tight. 11 … … … … 90

37 A New Voting Scheme Neighborhoods of (i) : Intervals ending at i. If majority in some neighborhood vote against (i), it is marked unpopular. Unpopularity based only on past, not the future. Thm: Let V( ) denote no. of unpopular numbers. Then Ed( )/2 V( ) 2 Ed( ) Can we estimate V( ) efficiently?

38 Outline of Sampling Scheme Taking a vote in one neighborhood: –Take O(log n) samples, take the (approx) majority. Reservoir Sampling [Vitter] Computing V( ) : Need O(log n) samples from every neighborhood.

39 Outline of Sampling Scheme Key observation: Dont need samples across intervals to be independent! Roughly O(log 2 n) samples suffice. Computing V( ) : Need O(log n) samples from every neighborhood.

40 Deterministic Algorithm for LIS Thm: For any ε > 0,there is a one-pass deterministic algorithm using O(n/ε) 1/2 space and update time, that gives a (1 - ε) approximation to LIS( ). Based on multiplayer communication protocol for LIS: 32 … … 1915 … 50 Algorithm simulates protocol for n players.

41 Two-Player Protocol for LIS … … 1319 Patience Sorting 6 24 … …1000 Multiples of εk n/2 k 1/ε

42 Approximating the LIS Conjecture: For some ε 0 > 0, every 1-pass deterministic algorithm that gives a (1 + ε 0 ) approximation to LIS( ) requires n) space. Consider k-player communication protocol for LIS: 32 … … 1915 … 50 As k increases, maximum message size increases. Proving the conjecture requires analyzing k n

43 Lower Bounds for approximating the LIS Conjecture: For some ε 0 > 0, every 1-pass deterministic algorithm that gives a (1 + ε 0 ) approximation to LIS( ) requires n) space. Candidate Hard Instances?

44 Lower Bounds for approximating the LIS Conjecture: For some ε 0 > 0, every 1-pass deterministic algorithm that gives a (1 + ε 0 ) approximation to LIS( ) requires n) space. Candidate Hard Instances? No Yes

45 Lower Bounds for approximating the LIS Conjecture: For some ε 0 > 0, every 1-pass deterministic algorithm that gives a (1 + ε 0 ) approximation to LIS( ) requires n) space. Candidate Hard Instances? No Yes

46 Lower Bounds for approximating the LIS Conjecture: For some ε 0 > 0, every 1-pass deterministic algorithm that gives a (1 + ε 0 ) approximation to LIS( ) requires n) space. Candidate Hard Instances? No Yes

47 Open Problems Estimate the Edit distance between two permutations. Tight bounds for approximation: Show (n) lower bound for deterministic algorithms. Randomized algorithm for LIS ?


Download ppt "Estimating the Sortedness of a Data Stream Parikshit GopalanU T Austin T. S. JayramIBM Almaden Robert KrauthgamerIBM Almaden Ravi KumarYahoo! Research."

Similar presentations


Ads by Google