Synonyms
Finiteness
Definition
The values in the relations of a relational database are elements of one or more underlying sets called domains. In practical applications, a domain may be infinite, e.g., the set of natural numbers. In this case, the value of a relational calculus query when applied to such a database may be infinite, e.g., {n| n ≥ 10}. A query Q is called finite if the value of Q when applied to any database is finite.
Even when the database domains are finite, all that is normally known about them is that they are some finite superset of the values that occur in the database. In this case, the value of a relational calculus query may depend on such an unknown domain, e.g., {x ∣ ∀ yR(x, y)}. A query Q is called domain independent if the value of Q when applied to any database is the same for any two domains containing the database values or, equivalently, if the value of Q when applied to a database contains only values that occur in the database.
The term safequery...
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 subscriptionsRecommended Reading
Abiteboul R, Hull R, Vianu V. Foundations of databases, chapter 5. Reading: Addison-Wesley; 1995. p. 70–104.
Benedikt M, Libkin L. Safe constraint queries. SIAM J Comput. 2000;29(5):1652–82.
DiPaola RA. The recursive unsolvability of the decision problem for the class of definite formulas. J ACM. 1969;16(2):324–7.
Escobar-Molano M, Hull R, Jacobs D. Safety and translation of calculus queries with scalar functions. In: Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1993. p. 253–64.
Hull R, Su J. Domain independence and the relational calculus. Acta Inform. 1994;31(6):513–24.
Kifer M. On Safety, Domain Independence, and Capturability of Database Queries (Preliminary Report). In: Proceedings of the 3rd International Conferences on Data and Knowledge Bases; 1988. p. 405–15.
Stolboushkin AP, Taitslin MA. Finite queries do not have effective syntax. Inf Comput. 1996;153(1):99–116.
Suciu D. Domain-independent queries on databases with external functions. Theor Comput Sci. 1998;190(2):279–315.
Topor RW. Domain independent formulas and databases. Theor Comput Sci. 1987;52(3):281–306.
Ullman JD. Principles of database and knowledge-base systems Volume I, Sections 3.2 and 3.8. Rockville: Computer Science Press; 1988. p. 100–6.
Vardi MY. The decision problem for database dependencies. Inf Process Lett. 1981;13(5):251–4.
Van Gelder A, Topor RW. Safety and translation of relational calculus aueries. ACM Trans Database Syst. 1981;16(2):235–78.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Topor, R. (2018). Safety and Domain Independence. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1255
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1255
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering