An Evolutionary Perspective on Approximate RDF Query Answering

, , , и .
Proceedings of the 2nd International Conference on Scalable Uncertainty Management, том 5291 из Lecture Notes in Computer Science, стр. 215--228. Berlin, Heidelberg, Springer, (октября 2008)
DOI: 10.1007/978-3-540-87993-0_18


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.


Пользователи данного ресурса

  • @schlobac
  • @gergie
  • @earthfare

Комментарии и рецензии