z-logo
open-access-imgOpen Access
Handling qualitative preferences in SPARQL over virtual ontology-based data access
Author(s) -
Marlene Gonçalves,
David Chaves-Fraga,
Óscar Corcho
Publication year - 2022
Publication title -
semantic web
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.862
H-Index - 45
eISSN - 2210-4968
pISSN - 1570-0844
DOI - 10.3233/sw-212895
Subject(s) - sparql , computer science , skyline , information retrieval , set (abstract data type) , ontology , preference , relational database , rdf , data mining , database , semantic web , mathematics , epistemology , programming language , philosophy , statistics
With the increase of data volume in heterogeneous datasets that are being published following Open Data initiatives, new operators are necessary to help users to find the subset of data that best satisfies their preference criteria. Quantitative approaches such as top-k queries may not be the most appropriate approaches as they require the user to assign weights that may not be known beforehand to a scoring function. Unlike the quantitative approach, under the qualitative approach, which includes the well-known skyline, preference criteria are more intuitive in certain cases and can be expressed more naturally. In this paper, we address the problem of evaluating SPARQL qualitative preference queries over an Ontology-Based Data Access (OBDA) approach, which provides uniform access over multiple and heterogeneous data sources. Our main contribution is Morph-Skyline++, a framework for processing SPARQL qualitative preferences by directly querying relational databases. Our framework implements a technique that translates SPARQL qualitative preference queries directly into queries that can be evaluated by a relational database management system. We evaluate our approach over different scenarios, reporting the effects of data distribution, data size, and query complexity on the performance of our proposed technique in comparison with state-of-the-art techniques. Obtained results suggest that the execution time can be reduced by up to two orders of magnitude in comparison to current techniques scaling up to larger datasets while identifying precisely the result set.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here