Abstract
Several alternative semantics (or interpretations) of the relational (domain) calculus are studied here. It is shown that they all have the same expressive power, i.e., the selection of any of the semantics neither gains nor loses expressive power.
Since the domain is potentially infinite, the answer to a relational calculus query is sometimes infinite (and hence not a relation). The following approaches which guarantee the finiteness of answers to queries are studied here:output-restricted unlimited interpretation, domain independent queries, output-restricted finite andcountable invention, andlimited interpretation. Of particular interest is the output-restricted unlimited interpretation—although the output is restricted to the active domain of the input and query, the quantified variables range over the infinite underlying domain. While this is close to the intuitive interpretation given to calculus formulas, the naive approach to evaluating queries under this semantics calls for the impossible task of examining infinitely many values. We describe here a constructiion which, given a queryQ under the output-restricted unlimited interpretation, yields a domain independent queryQ′, with length no more than exponential in the length ofQ, such thatQ andQ′ (under their respective semantics) express the same function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[AB88] Abiteboul, S., Beeri, C.: On the power of languages for the manipulation of complex objects. Technical Report No. 846, INRIA, May 1988
[AGSS86] Aylamazyan, A.K., Gilula, M.M., Stolboushkin, A.P., Schwartz, G.F.: Reduction of the relational model with infinite domain to the case of finite domains (Russian). Proc. USSR Acad. Sci. (Doklady)286(2), 308–311 (1986)
[AV87] Abiteboul, S., Vianu, V.: A transaction language complete for database update and specification. Proceedings of the ACM Symposium on Principles of Database Systems, pp. 260–268, 1987
[CH80] Chandra, A.K., Harel, D.: Computable queries for relational data bases. J. Comput. Syst. Sci.,21(2), 156–178 (1980)
[Cod70] Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM13(6), 377–387 (1970)
[Fag82] Fagin, R.: Horn clauses and database dependencies. J. ACM29(4), 952–985 (1982)
[HS89] Hull, R., Su, J.: Untyped sets, invention, and computable queries. Proceedings of the ACM Symposium on Principles of Database Systems, pp. 347–359, 1989
[HS91] Hull, R., Su, J.: On the expressive power of database queries with intermediate types. J. Comput. Syst. Sci.43(1), 219–267 (1991) (Special issue for PODS'88)
[Hul86] Hull R.: Relative information capacity of simple relational schemata. SIAM J. Comput.15(3), 856–886 (1986)
[Kif88] Kifer, M.: On safety, domain independence, and capturability of database queries. Proceedings of the 3rd International Conference on Data and Knowledge Based, pp. 405–415, Jerusalem, Israel, 1988
[KV88] Kuper, G.M., Vardi, M.Y.: On the complexity of queries in the logical data model. In: Gyssens, M., Paredaens, J., Gucht, D. van (eds.) ICDT'88-Proceedings 2nd International Conference on Database Theory (Lect. Notes Comput. Sci., vol. 326, pp. 267–280). Berlin, Heidelberg, New York: Springer (1988)
[Mai83] Maier, D.: The theory of relational databases. Potomac, MD: Computer Science Press 1983
[Ull82] Ullman, J.D.: Principles of database systems, 2nd edn., Potomac, MD: Computer Science Press 1982
Author information
Authors and Affiliations
Additional information
This work supported in part by NSF grants IST-85-11541 and IRI-87-19875
Work by this author was also supported in part by NSF grant IRI-9109520
Rights and permissions
About this article
Cite this article
Hull, R., Su, J. Domain independence and the relational calculus. Acta Informatica 31, 513–524 (1994). https://doi.org/10.1007/BF01213204
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01213204