Root Rank
Vinay M. S, Jayant R. Haritsa · 2019
A popular approach to hosting Keyword Search Systems (KWS) on relational DBMS platforms is to employ the Candidate Network framework. The quality of a Candidate Network-based search is critically dependent on the scoring function used to rank the relevant answers. In this paper, we first demonstrate, through a detailed empirical study, that the Labrador scoring function provides the best user relevance among contemporary Candidate Network scoring functions.