RAL: an Algebra for Querying RDF

  • Authors:
  • Flavius Frasincar;Geert-Jan Houben;Richard Vdovjak;Peter Barna

  • Affiliations:
  • -;-;-;-

  • Venue:
  • WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

To make the WWW machine-understandable there is astrong demand both for languages describing metadata andfor languages querying metadata. The Resource DescriptionFramework (RDF), a language proposed by W3C, canbe used for describing metadata about (Web) resources.RDF Schema (RDFS) extends RDF by providing meansfor creating application specific vocabularies (ontologies).While the two above languages are widely acknowledgedas a standard means for describing Web metadata, a standardizedlanguage for querying RDF metadata is still anopen issue. Research groups coming from both industry andacademia are presently involved in proposing several RDFquery languages. Due to the lack of an RDF algebra suchquery languages use APIs to describe their semantics andoptimization issues are mostly neglected. This paper proposesRAL, an RDF algebra suitable for defining (and comparing)the semantics of different RDF query languages and(at a future stage) for performing algebraic optimizations.After the definition of the data model we present the operatorsby means of which the model can be manipulated.The operators come in three flavors: extraction operatorsretrieve the needed resources from the input RDF model,loop operators support repetition, and construction operatorsbuild the resulting RDF model.