Outline ● Motivation ● Problem formulation e Trie-based framework Trie-based algorithms o Optimizing partition Scheme ° Experiment ● Conclusion 1/28/2021 aste@ ICDE2012
Outline Motivation Problem Formulation Trie-based Framework Trie-based Algorithms Optimizing Partition Scheme Experiment Conclusion 1/28/2021 Taste @ ICDE2012 11/42
Observation ●Setτ=2 entity: vankatesh s v a n k a t h 9o split the entity into t+1=3 segments sosooso a substring in document u 1/28/2021 Taste@ ICDE2012 12/42
Observation Set τ=2 entity:vankatesh 1/28/2021 Taste @ ICDE2012 12/42 Split the entity into τ+1=3 segments A substring in document document: …voncouver…
Observation ●Setτ=2 entity: vankatesh nk a t e s h oo3:SsosSo >=1 1 edit operation edit operation editoperatiod =t+1=3 u edit operation NOT SIMILAR 1/28/2021 Taste@ ICDE2012
Observation Set τ=2 entity:vankatesh 1/28/2021 Taste @ ICDE2012 13/42 >= 1 edit operation >= 1 edit operation >= 1 edit operation >= τ + 1 = 3 edit operation NOT SIMILAR document: …voncouver…
Observation o Valid Substring: s is a valid substring if min t<=|s|<=Ln matt the minimum entity length Lmay the maximum entity length 1/28/2021 Taste@ ICDE2012
Observation Valid Substring: s is a valid substring if Lmin− τ <=|s|<= Lmax+ τ Lmin: the minimum entity length. Lmax: the maximum entity length. 1/28/2021 Taste @ ICDE2012 14/42
Trie-based framework o Stepl: Partition entities into segments using even partition scheme 1 vancouver 2 vanateshe 3 surajit chaudri 4 caushit chaudui 5 caushit chakra 1/28/2021 Taste@ ICDE2012
Trie-based Framework Step1: Partition entities into segments using even partition scheme. 1/28/2021 Taste @ ICDE2012 15/42