Top-k Matching Queries for Filter-Based Profile Matching in Knowledge Bases
Finding the best matching job offers for a candidate profile or, the best candidates profiles for a particular job offer, respectively constitutes the most common and most relevant type of queries in the Human Resources (HR) sector. This technically requires to investigate top-k queries on top of knowledge bases and relational databases. We propose in this paper a top-k query algorithm on relational databases able to produce effective and efficient results. The approach is to consider the partial order of matching relations between jobs and candidates profiles together with an efficient design of the data involved. In particular, the focus on a single relation, the matching relation, is crucial to achieve the expectations.
KeywordsRelational Database Matching Relation Applicant Profile Minimum Match Profile Match
- 4.Popov, N., Jebelean, T.: Semantic matching for job search engines: a logical approach. Technical report 13-02, RISC Report Series, University of Linz, Austria (2013)Google Scholar
- 7.Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, pp. 648–659, 31 August–3 September 2004Google Scholar