ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Root rank: A relational operator for KWS result ranking

Vinay, MS and Haritsa, JR (2019) Root rank: A relational operator for KWS result ranking. In: ACM India Joint 6th ACM iKDD International Conference on Data Science and 24th International Conference on Management of Data, CoDS-COMAD 2019, 3 - 5 January 2019, Kolkata, pp. 103-111.

[img] PDF
acm_int_con_103-111_2019.pdf - Published Version
Restricted to Registered users only

Download (410kB) | Request a copy
Official URL: https://doi.org/10.1145/3297001.3297014

Abstract

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. Efficiently incorporating the Labrador function, however, is rendered difficult due to its Result Set Dependent (RSD) characteristic, wherein the distribution of keywords in the query results influences the ranking. In this paper, we investigate addressing the RSD challenge through inclusion of custom operators within the database engine. Specifically, we propose and evaluate an operator called Root Rank, which performs result ranking in the root of the query execution plan. The Root Rank operator has been implemented on a PostgreSQL codebase, and its performance profiled over real-world data sets, including DBLP and Wikipedia. Our experimental observations indicate that the Root Rank operator is highly successful in delivering processing times that are comparable to, or better than, those of non-RSD implementations. We expect these results to aid in the organic hosting of KWS functionality on database systems.

Item Type: Conference Paper
Publication: ACM International Conference Proceeding Series
Publisher: Association for Computing Machinery
Additional Information: The copyright for this article belongs to Association for Computing Machinery.
Keywords: Database systems; Search engines, Candidate network; Database engine; Empirical studies; Processing time; Query execution plan; Relational DBMS; Relational operator; Scoring functions, Query processing
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 29 Nov 2022 09:20
Last Modified: 29 Nov 2022 09:20
URI: https://eprints.iisc.ac.in/id/eprint/78100

Actions (login required)

View Item View Item