Skip to main content

Safety and Domain Independence

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems
  • 147 Accesses

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 to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Abiteboul R, Hull R, Vianu V. Foundations of databases, chapter 5. Reading: Addison-Wesley; 1995. p. 70–104.

    Google Scholar 

  2. Benedikt M, Libkin L. Safe constraint queries. SIAM J Comput. 2000;29:1652–82.

    Article  MathSciNet  MATH  Google Scholar 

  3. DiPaola RA. The recursive unsolvability of the decision problem for the class of definite formulas. J ACM. 1969;16(2):324–7.

    Article  Google Scholar 

  4. 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.

    Google Scholar 

  5. Hull R, Su J. Domain independence and the relational calculus. Acta Inform. 1994;31:513–24.

    Article  MathSciNet  MATH  Google Scholar 

  6. 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.

    Google Scholar 

  7. Stolboushkin AP, Taitslin MA. Finite queries do not have effective syntax. Inf Comput. 1996;153(1):99–116.

    Article  MathSciNet  MATH  Google Scholar 

  8. Suciu D. Domain-independent queries on databases with external functions. Theor Comput Sci. 1998;190(2):279–315.

    Article  MathSciNet  MATH  Google Scholar 

  9. Topor RW. Domain independent formulas and databases. Theor Comput Sci. 1987;52(3):281–306.

    Article  MathSciNet  MATH  Google Scholar 

  10. 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.

    Google Scholar 

  11. Vardi MY. The decision problem for database dependencies. Inf Process Lett. 1981;13(5):251–4.

    Article  MathSciNet  MATH  Google Scholar 

  12. Van Gelder A, Topor RW. Safety and translation of relational calculus aueries. ACM Trans Database Syst. 1981;16(2):235–78.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rodney Topor .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Topor, R. (2016). Safety and Domain Independence. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1255-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_1255-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics