Advertisement

Triadic Relations: An Algebra for the Semantic Web

  • Edward L. Robertson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3372)

Abstract

This paper introduces and develops an algebra over triadic relations (relations whose contents are only triples). In essence, the algebra is a severely restricted variation of relational algebra (RA) that is de.ned over relations with exactly three attributes and is closed for the same set of relations. In particular, arbitrary joins and Cartesian products are replaced by a single three-way join. Ternary relations are important because they provide the minimal, and thus most uniform, way to encode semantics wherein metadata may be treated uniformly with regular data; this fact has been recognized in the choice of triples to formalize the Semantic Web via RDF. Indeed, algebraic de.nitions corresponding to certain of these formalisms will be shown as examples.

An important aspect of this algebra is an encoding of triples, implementing a kind of rei.cation. The algebra is shown to be equivalent, over non-rei.ed values, to a restriction of Datalog and hence to a fragment of .rst order logic. Furthermore, the algebra requires only two operators if certain .xed in.nitary constants (similar to Tarski’s identity) are present. In this case, all structure is represented only in the data, that is, in the encodings that these in.nitary constants represent.

Keywords

Transitive Closure Ternary Relation Relative Complement Binary Relationship Relational Calculus 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Micheael Dunn, J.: A representation of relation algebras using Routly-Meyer frames. In: Anthony Anderson, C., Zelëny, M. (eds.) Logic, Meaning, and Computation, pp. 77–108. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  2. 2.
    Gutierrez, C., Hurtaddo, C., Mendelzon, A.: Foundations of semantic web databases. In: ACM Principles of Database System (2004)Google Scholar
  3. 3.
    Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)Google Scholar
  4. 4.
    Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. of ACM 42(4), 741–843 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Miller, L., Seaborne, A., Reggiori, A.: Three implementations of squishql, a simple rdf query language. In: International Semantic Web Conference, ISWC (2002)Google Scholar
  6. 6.
    Peirce, C.S.: On the algebra of logic. Amer. J. of Math. 180–202 (1885)Google Scholar
  7. 7.
    Sowa, J.F.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole (2000)Google Scholar
  8. 8.
    Tarski, A.: On the calculus of relations. J. of Symbolic Logic 6(3), 73–89 (1941)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Ullman, J.D.: Princ. of Database abd KnowledgeBase Systems. Fundamental Concepts, vol. I. Computer Science Press, New York (1988)Google Scholar
  10. 10.
    Van Gucht, D., Saxton, L.V., Gyssens, M.: Tagging as an alternative to object creation. In: Freytag, H.C., Maier, D., Vossen, G. (eds.) Query Processing for Advanced Database Systems, pp. 201–242. Morgan Kaufmann, San Francisco (1994)Google Scholar
  11. 11.
    W3C. Defining n-ary relations on the semantic web: Use with individuals (1999), http://www.w3.org/TR/swbp-n-aryRelations
  12. 12.
    W3C. RDF Model Theory (2002), http://www.w3.org/TR/rdf-mt/
  13. 13.
    Yang, G., Kifer, M.: On the sematntics of anonmous identity and reification. In: DBLP 2002. LNCS, vol. 2519, pp. 1047–1066. Springer, Heidelberg (2002)Google Scholar
  14. 14.
    Yang, G., Kifer, M., Zhao, C.: Flora-2: User’s manual (June 2002), http://flora.sourceforge.net

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Edward L. Robertson
    • 1
  1. 1.Computer Science Dept. and School of InformaticsIndiana UniversityBloomington

Personalised recommendations