Pivotal Entry-based Method Definition 3 (Pivotal Triple): Given an entry(n,i), one of n's children nc, and a query g, triple(n, i, nc)is called a pivotal triple, if ed(ne gli, j+1)>eD(n, qll, il) th node of trie (n;j ne j i-th character of Query n:a child of n Px: pivotal triples with ED(n;, Ql1.jl)=X 2/2/2021 Topk Search(@ ICD E2013Pivotal Entry-based Method 2/2/2021 TopkSearch @ ICDE2013 34/42 (ni j nc ) Px: pivotal triples with ED(ni , Q[1 … j])=x Definition 3 (Pivotal Triple): Given an entry ⟨n, j⟩, one of n’s children nc , and a query q, triple ⟨n, j, nc ⟩ is called a pivotal triple, if ED(nc , q[1, j + 1]) > ED(n, q[1, j]). ni : i-th node of trie nc : a child of ni j : j-th character of Query