Sign up & Download
Sign in

An Evolutionary Perspective on Approximate RDF Query Answering

by Christophe Guéret, Eyal Oren, Stefan Schlobach, Martijn Schut
Scalable Uncertainty Management (2008)

Abstract

RDF is increasingly being used to represent large amounts of data on the Web. Current query evaluation strategies for RDF are inspired by databases, assuming perfect answers on finite repositories. In this paper, we focus on a query method based on evolutionary computing, which allows us to handle uncertainty, incompleteness and unsatisfiability, and deal with large datasets, all within a single conceptual framework. Our technique supports approximate answers with ``anytime'' behaviour. We present scalability results and next steps for improvement.

Cite this document (BETA)

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in

Readership Statistics

4 Readers on Mendeley
by Discipline
 
 
by Academic Status
 
50% Post Doc
 
25% Ph.D. Student
 
25% Researcher (at a non-Academic Institution)
by Country
 
50% Netherlands
 
25% Switzerland
 
25% United Kingdom