Efficient Trust-Based Approximate SPARQL Querying of the Web of Linked Data

  • Kuldeep B. R. Reddy
  • P. Sreenivasa Kumar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7123)

Abstract

The web of linked data represents a globally distributed dataspace, which can be queried using the SPARQL query language. However, with the growth in size and complexity of the web of linked data, it becomes impractical for the user to know enough about its structure and semantics for the user queries to produce enough answers. Moreover, there is a prevalence of unreliable data which can dominate the query results misleading the users and software agents. These problems are addressed in the paper by making use of ontologies available on the web of linked data to produce approximate results and also by presenting a trust model that associates RDF statements with trust values, which is used to give prominence to trustworthy data. Trustworthy approximate results can be generated by performing the relaxation steps at compile-time leading to the generation of multiple relaxed queries that are sorted in decreasing order of their similarity scores with the original query and executed. During their execution the trust scores of RDF data fetched are computed. However, the relaxed queries generated have conditions in common and we propose that by performing trust-based relaxations on-the-fly at runtime, the shared data between several relaxed queries need not be fetched repeatedly. Thus, the trust-based relaxation steps are integrated with the query execution itself resulting in performance benefits. Further opportunities for optimizations during query execution are identified and are used to prune relaxation steps which do not produce results. The implementation of our approach demonstrates its efficacy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bizer, C., Heath, T., Berners-Lee, T.: Linked data – the story so far. International Journal on Semantic Web and Information Systems 5(3), 1–22 (2009)CrossRefGoogle Scholar
  2. 2.
    Tummarello, G., Delbru, R., Oren, E.: Sindice.com: Weaving the open linked data, pp. 552–565 (2008)Google Scholar
  3. 3.
    Quilitz, B., Leser, U.: Querying Distributed RDF Data Sources with SPARQL. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 524–538. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL Queries over the Web of Linked Data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Huang, H., Liu, C., Zhou, X.: Computing Relaxed Answers on RDF Databases. In: Bailey, J., Maier, D., Schewe, K.-D., Thalheim, B., Wang, X.S. (eds.) WISE 2008. LNCS, vol. 5175, pp. 163–175. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Reddy, K.B., Kumar, P.S.: Efficient approximate SPARQL querying of the web of linked data. In: Proceedings of the ISWC Workshop on Uncertainity Reasoning over the Semantic Web, URSW 2010. CEUR-WS (2010)Google Scholar
  7. 7.
    Hartig, O.: Querying Trust in RDF Data with tSPARQL. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. LNCS, vol. 5554, pp. 5–20. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Hartig, O.: Provenance information in the web of data. In: LDOW 2009, Madrid, Spain, April 20 (2009)Google Scholar
  9. 9.
    Zaihrayeu, I., da Silva, P.P., McGuinness, D.L.: IWTrust: Improving User Trust in Answers from the Web. In: Herrmann, P., Issarny, V., Shiu, S. (eds.) iTrust 2005. LNCS, vol. 3477, pp. 384–392. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Gil, Y., Ratnakar, V.: Trusting Information Sources One Citizen at a Time. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 162–176. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Golbeck, J.: Generating Predictive Movie Recommendations from Trust in Social Networks. In: Stølen, K., Winsborough, W.H., Martinelli, F., Massacci, F. (eds.) iTrust 2006. LNCS, vol. 3986, pp. 93–104. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Reddy, K.B., Kumar, P.S.: Optimizing SPARQL queries over the web of linked data. In: Proceedings of the VLDB Workshop on Semantic Data Management, SemData 2010. CEUR-WS (2010)Google Scholar
  13. 13.
    Guo, Y., Pan, Z., Heflin, J.: LUBM: A benchmark for OWL knowledge base systems. J. Web Sem. 3(2-3), 158–182 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kuldeep B. R. Reddy
    • 1
  • P. Sreenivasa Kumar
    • 1
  1. 1.Indian Institute of Technology MadrasChennaiIndia

Personalised recommendations