Coloring RDF Triples to Capture Provenance

  • Giorgos Flouris
  • Irini Fundulaki
  • Panagiotis Pediaditis
  • Yannis Theoharis
  • Vassilis Christophides
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5823)


Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and knowledge bases with millions of RDF triples from Wikipedia and other sources, mostly in e-science, have been created and are publicly available. Recording provenance information of RDF triples aggregated from different heterogeneous sources is crucial in order to effectively support trust mechanisms, digital rights and privacy policies. Managing provenance becomes even more important when we consider not only explicitly stated but also implicit triples (through RDFS inference rules) in conjunction with declarative languages for querying and updating RDF graphs. In this paper we rely on colored RDF triples represented as quadruples to capture and manipulate explicit provenance information.


Inference Rule Provenance Information Coherence Semantic Blank Node Atomic Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Berners-Lee, T., Hendler, J., Lassila, O.: The Semantic Web. Scientific American-American Edition (2001)Google Scholar
  2. 2.
    Brickley, D., Guha, R.V.: RDF Vocabulary Description Language 1.0: RDF Schema (2004),
  3. 3.
    Buneman, P., Chapman, A.P., Cheney, J.: Provenance Management in Curated Databases. In: SIGMOD (2006)Google Scholar
  4. 4.
    Buneman, P., Cheney, J., Vansummeren, S.: On the Expressiveness of Implicit Provenance in Query and Update Languages. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 209–223. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Carroll, J., Bizer, C., Hayes, P., Stickler, P.: Named graphs, Provenance and Trust. In: WWW (2005)Google Scholar
  6. 6.
    Christophides, V., Plexousakis, D., Scholl, M., Tourtounis, S.: On labeling schemes for the semantic web. In: WWW (2003)Google Scholar
  7. 7.
    Dumbill, E.: Tracking Provenance of RDF Data. Technical report, ISO/IEC (2003)Google Scholar
  8. 8.
    McBride, B., Manola, F., Miller, E.: B.M.: RDF Primer (February 2004),
  9. 9.
    Gardenfors, P.: Belief Revision: An Introduction. Belief Revision (29), 1–28 (1992)Google Scholar
  10. 10.
    Gardenfors, P.: The dynamics of belief systems: Foundations versus coherence theories. Revue Internationale de Philosophie 44, 24–46 (1992)Google Scholar
  11. 11.
    Geerts, F., den Bussche, J.V.: Relational Completeness of Query Languages for Annotated Databases. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797, pp. 127–137. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Geerts, F., Kementsietsidis, A., Milano, D.: MONDRIAN: Annotating and Querying Databases through Colors and Blocks. In: ICDE. (2006)Google Scholar
  13. 13.
    Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: PODS (2007)Google Scholar
  14. 14.
    Gutierrez, C., Hurtado, C.A., Mendelzon, A.O.: Foundations of Semantic Web Databases. In: PODS (2004)Google Scholar
  15. 15.
    Hayes, P.: RDF Semantics (February 2004),
  16. 16.
    Le-Phuoc, D., Polleres, A., Hauswirth, M., Tummarello, G., Morbidoni, C.: Rapid Prototyping of Semantic Mash-ups through Semantic Web Pipes. In: WWW (2009)Google Scholar
  17. 17.
    MacGregor, R., Ko, I.Y.: Representing Contextualized Data using Semantic Web Tools. In: Practical and Scalable Semantic Systems,conjunction with ISWC (2003)Google Scholar
  18. 18.
    Munoz, S., Perez, J., Gutierrez, C.: Minimal deductive systems for RDF. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 53–67. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  19. 19.
    Pediaditis, P.: Querying and Updating RDF/S Named Graphs. Master’s thesis, Computer Science Department, University of Crete (2008)Google Scholar
  20. 20.
    Pediaditis, P., Flouris, G., Fundulaki, I., Christophides, V.: On Explicit Provenance Management in RDF/S Graphs. In: TAPP (2009)Google Scholar
  21. 21.
    Perez, J., Arenas, M., Gutierrez, C.: Semantics and Complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 30–43. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  22. 22.
    Perez, J., Arenas, M., Gutierrez, C.: nSPARQL: A Navigational Language for RDF. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 66–81. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  23. 23.
    Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF (January 2008),
  24. 24.
  25. 25.
    DBLP Comp. Science Bibliography,
  26. 26.
  27. 27.
  28. 28.
  29. 29.
  30. 30.
    Schenk, S., Staab, S.: Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the Web. In: WWW (2008)Google Scholar
  31. 31.
    Seaborne, A., Manjunath, G.: SPARQL/Update: A language for updating RDF graphs (April 2008),
  32. 32.
    Serfiotis, G., Koffina, I., Christophides, V., Tannen, V.: Containment and Minimization of RDF/S Query Patterns. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 607–623. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  33. 33.
    Tan, W.C.: Provenance in databases: Past, current, and future. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering (2007)Google Scholar
  34. 34.
    Watkins, E., Nicole, D.: Named Graphs as a Mechanism for Reasoning About Provenance. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, pp. 943–948. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  35. 35.
    Zeginis, D., Tzitzikas, Y., Christophides, V.: On the Foundations of Computing Deltas Between RDF Models. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 637–651. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Giorgos Flouris
    • 1
  • Irini Fundulaki
    • 1
  • Panagiotis Pediaditis
    • 1
    • 2
  • Yannis Theoharis
    • 1
    • 2
  • Vassilis Christophides
    • 1
    • 2
  1. 1.Institute of Computer Science, FORTHGreece
  2. 2.Computer Science DepartmentUniversity of CreteGreece

Personalised recommendations