What is it about?
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.
Featured Image
Why is it important?
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.
Perspectives
In particular, the focus on a single relation, the matching relation, is crucial to achieve the expectations.
Dr Jorge Martinez-Gil
Software Competence Center Hagenberg GmbH
Read the Original
This page is a summary of: Top-k Matching Queries for Filter-Based Profile Matching in Knowledge Bases, January 2016, Springer Science + Business Media,
DOI: 10.1007/978-3-319-44406-2_23.
You can read the full text:
Resources
Contributors
The following have contributed to this page
