Abstract
The tuple relational calculus has been based on the classical predicate logics. Databases are however not exactly representable in this calculus. They are finite. This finiteness results in a different semantics. The result of a query must be finite as well and must be based on the values in the database and in the query. In this case, negation and disjunction of query expression must be defined in a different way. The classical theory has developed restrictions to the tuple relational calculus such as safe formulas.
This paper takes a different turn. We introduce a different definition of the tuple relational calculus and show that this calculus is equivalent to the relational algebra and thus equivalent to the safe tuple relational calculus.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases. Addison-Wesley, Reading (1995)
Atzeni, P., Ceri, S., Paraboschi, S., Torlone, R.: Database systems: concepts, languages & architectures. McGraw-Hill, London (1999)
Beeri, C., Thalheim, B.: Identification as a primitive of database models. In: Proc. FoMLaDO 1998, pp. 19–36. Kluwer, London (1999)
Codd, E.F.: A relational model for large shared data banks. CACM 13(6), 197–204 (1970)
Codd, E.F.: Relational completeness of data base sublanguages. In: Rustin, R. (ed.) Data base systems, pp. 65–98. Prentice-Hall, Englewood Cliffs (1971)
Codd, E.F.: Further normalization of the database model. In: Rustin, R. (ed.) Data Base Systems, pp. 33–64. Prentice-Hall, Englewood Cliffs (1972)
Hartmann, S., Hoffmann, A., Link, S., Schewe, K.-D.: Axiomatizing functional dependencies in the higher-order entity-relationship model. Inf. Process. Lett. 87(3), 133–137 (2003)
Hartmann, S., Köhler, H., Link, S., Thalheim, B.: Armstrong databases and reasoning for functional dependencies and cardinality constraints over partial bags. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 164–183. Springer, Heidelberg (2012)
Hartmann, S., Köhler, H., Link, S., Trinh, T., Wang, J.: On the notion of an XML key. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 103–112. Springer, Heidelberg (2008)
Hartmann, S., Link, S., Schewe, K.-D.: Functional dependencies over XML documents with dtds. Acta Cybern. 17(1), 153–171 (2005)
Kandzia, P., Klein, H.-J.: Theoretische Grundlagen relationaler Datanbanksysteme. BI Wissenschaftsverlag, Mannheim (1993)
Lenz, H.-J., Thalheim, B.: A formal framework of aggregation for the olap-oltp model. J. UCS 15(1), 273–303 (2009)
Levene, M., Loizou, G.: A guided tour of relational databases and beyond. Springer, Berlin (1999)
Maier, D.: The theory of relational databases. Computer Science Press, Rockville (1983)
Schewe, K.-D., Thalheim, B.: Readings in object-oriented databases. Reprint, BTU-Cottbus, accessible through http://www.is.informatik.uni-kiel.de/~thalheim. Collection of papers by Beeri, C., Schewe, K.-D., Schmidt, J.-W., Stemple, D., Thalheim, B., Wetzel, I. (1998)
Thalheim, B.: Entity-relationship modeling - Foundations of database technology. Springer, Berlin (2000)
Thalheim, B.: Open problems of information systems research and technology. In: Kobyliński, A., Sobczak, A. (eds.) BIR 2013. LNBIP, vol. 158, pp. 10–18. Springer, Heidelberg (2013)
Yang, C.-C.: Relational Databases. Prentice-Hall, Englewood Cliffs (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
AlBdaiwi, B., Thalheim, B. (2015). Revisiting the Definition of the Relational Tuple Calculus. In: Morzy, T., Valduriez, P., Bellatreche, L. (eds) New Trends in Databases and Information Systems. ADBIS 2015. Communications in Computer and Information Science, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-23201-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-23201-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23200-3
Online ISBN: 978-3-319-23201-0
eBook Packages: Computer ScienceComputer Science (R0)