Querying the semantic web with preferences

  • Authors:
  • Wolf Siberski;Jeff Z. Pan;Uwe Thaden

  • Affiliations:
  • L3S and University of Hannover, Hannover;University of Aberdeen;L3S and University of Hannover, Hannover

  • Venue:
  • ISWC'06 Proceedings of the 5th international conference on The Semantic Web
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.