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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Gutierrez, C., Hurtaddo, C., Mendelzon, A.: Foundations of semantic web databases. In: ACM Principles of Database System (2004)
Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)
Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. J. of ACM 42(4), 741–843 (1995)
Miller, L., Seaborne, A., Reggiori, A.: Three implementations of squishql, a simple rdf query language. In: International Semantic Web Conference, ISWC (2002)
Peirce, C.S.: On the algebra of logic. Amer. J. of Math. 180–202 (1885)
Sowa, J.F.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole (2000)
Tarski, A.: On the calculus of relations. J. of Symbolic Logic 6(3), 73–89 (1941)
Ullman, J.D.: Princ. of Database abd KnowledgeBase Systems. Fundamental Concepts, vol. I. Computer Science Press, New York (1988)
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)
W3C. Defining n-ary relations on the semantic web: Use with individuals (1999), http://www.w3.org/TR/swbp-n-aryRelations
W3C. RDF Model Theory (2002), http://www.w3.org/TR/rdf-mt/
Yang, G., Kifer, M.: On the sematntics of anonmous identity and reification. In: DBLP 2002. LNCS, vol. 2519, pp. 1047–1066. Springer, Heidelberg (2002)
Yang, G., Kifer, M., Zhao, C.: Flora-2: User’s manual (June 2002), http://flora.sourceforge.net
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robertson, E.L. (2005). Triadic Relations: An Algebra for the Semantic Web. In: Bussler, C., Tannen, V., Fundulaki, I. (eds) Semantic Web and Databases. SWDB 2004. Lecture Notes in Computer Science, vol 3372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31839-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-31839-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24576-6
Online ISBN: 978-3-540-31839-2
eBook Packages: Computer ScienceComputer Science (R0)