4. The method of claim 3 where determining the predicted records by âˆ© i=1 lâˆ’1 l l âˆ©(âˆª j=1 q ) comprises determining the union I l =âˆª j=1 q I l j of the predicted-record lists of the partial keyword k i to generate an ordered predicted list by using a sort-merge algorithm and then determining the intersection of several lists âˆ© i=1 l I l by using a merge-join algorithm to intersect the lists, assuming these lists are pre-sorted or determining whether each record on the short lists appears in other long lists by doing a binary search or a hash-based lookup.
3. The method of claim 2 where returning the top-t records in R Q for a given value t, ranked by their relevancy to the query comprises tokenizing a query string into several keywords, k 1 ; k 2 ; : : : ; k i ; for each keyword k i (1â‰¦iâ‰¦lâˆ’1) determining only a predicted word, k i , and one predicted-record list of a trie node corresponding to k i , denoted as l i , where q predicted words for k i , and their corresponding predicted record lists are l l1 ; l l2 ; : : : ; l lq , and determining the predicted records by âˆ© i=1 lâˆ’1 l i âˆ©(âˆª j=1 q l l j ) namely taking the union of the lists of predicted keywords for partial words, and intersecting the union of lists of predicted keywords for partial words with lists of the complete keywords.