Ranking is an important concept to avoid empty or overfull and unordered result sets. However, such scoring can only express total orders, which restricts its usefulness when several factors influence result relevance. A more flexible way to express relevance is the notion of preferences. Users state which kind of answers they 'prefer' by adding soft constraints to their queries. Current approaches in the Semantic Web offer only limited facilities for specification of scoring and result ordering. There is no common language element to express and formalize ranking and preferences. We present a comprehensive extension of SPARQL which directly supports the expression of preferences. This includes formal syntax and semantics of preference expressions for SPARQL. Additionally, we report our implementation of preference query processing, which is based on the ARQ query engine. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Siberski, W., Pan, J. Z., & Thaden, U. (2006). Querying the Semantic Web with preferences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4273 LNCS, pp. 612–624). Springer Verlag. https://doi.org/10.1007/11926078_44
Mendeley helps you to discover research relevant for your work.