Trie-based framework o Step2 Index the segments using a trie structure 14 2 26 33 a k8119+22293436 a)(0 a e 35 91 20+23+8↓303s 37 U(u e 1021 24 31 a)(r)(u)(S c2h a 25 32 2[584[45]4528112 1/28/2021 aste@ ICDE2012
Trie-based Framework Step2: Index the segments using a trie structure 1/28/2021 Taste @ ICDE2012 16/42
Trie-based framework o Step3: From the document, find the matched segments from the trie structure o Baseline: Trie-search method 3.1 Enumerator all valid substrings 3.2 Find each suffix of every substring in the trie structure to check if it can reach the leaf node 3.3 Verify the candidate pairs 1/28/2021 Taste@ ICDE2012
Trie-based Framework Step3: From the document, find the matched segments from the trie structure. Baseline: Trie-search Method 3.1 Enumerator all valid substrings. 3.2 Find each suffix of every substring in the trie structure to check if it can reach the leaf node. 3.3 Verify the candidate pairs. 1/28/2021 Taste @ ICDE2012 17/42
Trie-search method 03.1 Enumerator all valid substrings ifLmin-T=9-2=7 Lr max +t=15+2=17 kaushit chekrabarti, surajit chaudhuri, vankatesh ganti Len =7 1/28/2021 aste@ ICDE2012 18/4
Trie-search Method 3.1 Enumerator all valid substrings. 1/28/2021 Taste @ ICDE2012 18/42 kaushit chekrabarti, surajit chaudhuri, vankatesh ganti, if Lmin - τ = 9-2=7 Lmax + τ = 15+2=17 Len = 7
Trie-search method 03.1 Enumerator all valid substrings ifLmin-T=9-2=7 Lr max +t=15+2=17 kaushit chekrabarti, surajit chaudhuri, vankatesh ganti len=8 1/28/2021 aste@ ICDE2012 19/42
Trie-search Method 3.1 Enumerator all valid substrings. 1/28/2021 Taste @ ICDE2012 19/42 kaushit chekrabarti, surajit chaudhuri, vankatesh ganti, if Lmin - τ = 9-2=7 Lmax + τ = 15+2=17 Len = 8