Skip to main content
SpringerLink
Log in
Book cover

Relational Methods for Computer Science Applications pp 97–109Cite as

On a Static Verification of Integrity Constraints in Relational Databases

  • Chapter

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 65))

Abstract

The paper proposes a new approach to verification of integrity constraints in relational databases. According to the relational database paradigm, integrity constraints express certain conditions that should be preserved by all instances of a given database. Usually these conditions are checked dynamically, when the database is updated.

A static verification of integrity constraints, based on a technique of elimination of the second-order quantifiers is proposed and investigated in the current paper. The static approach allows one to verify whether given constraints have been preserved already during the database design phase. This results in better system performance, because no runtime checking is required when committing a statically verified transaction to the database.

Supported in part by the Wallenberg Foundation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul S., Hull R., Vianu V. (1996) Foundations of Databases. AddisonWesley Pub. Co.

    Google Scholar 

  2. Ackermann W. (1935) Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110, 390–413

    Article  MathSciNet  Google Scholar 

  3. Chakravarthy U.S., Grant J., Minker J. (1987) Foundations of Semantic Query Optimization for Deductive Databases. In: Minker J. (Ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., Inc.

    Google Scholar 

  4. Colomb R.M. (1998) Deductive Databases and Their Applications. Taylor & Francis Ltd.

    Google Scholar 

  5. Doherty P., Lukaszewicz W., Szalas A. (1997) Computing Circumscription Revisited. A Reduction Algorithm. Journal of Automated Reasoning, 18, 3:297–336

    Article  MathSciNet  MATH  Google Scholar 

  6. Doherty P., Lukaszewicz W., Szalas A. (1999) Declarative PTIME Queries for Relational Databases using Quantifier Elimination. Journal of Logic and Computation, 9, 97:737–758

    Article  MathSciNet  MATH  Google Scholar 

  7. Ebbinghaus H-D., Flum J. (1995) Finite Model Theory. Springer-Verlag

    Book  MATH  Google Scholar 

  8. Kachniarz J., Szalas A. (1999) On a Certain Approach to Static Verification of Integrity Constraints in Relational Databases. In: Proc. of Conf. on Applications of Mathematics in Computer Science and Economy, Olsztyn, 123–134. In Polish

    Google Scholar 

  9. Lloyd J., Topor W. (1985) A Basis for Deductive Database Systems. Journal of Logic Programming, 2, 2:93–109

    Article  MathSciNet  MATH  Google Scholar 

  10. Kowalski R. (1978) Logic for Data Description. In: Minker J. (Ed.) Logic and Data Bases, Plenum Press

    Google Scholar 

  11. Reiter R. (1988) On Integrity Constraints. In: Proc. of the 2nd Conf. on the Theoretical Aspects of Reasoning about Knowledge, 97–111, Morgan Kaufmann Pub., Inc.

    Google Scholar 

  12. Sadri F., Kowalski R. (1987) A Theorem Proving Approach to Database Integrity. In: Minker J. (Ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., Inc.

    Google Scholar 

  13. Szalas A. (1993) On the Correspondence between Modal and Classical Logic. An Automated Approach. Journal of Logic and Computation, 3:605–620

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Soft Computer Consultants, 34350 US 19N, Palm Harbor, FL, 34684, USA

    Jarosław Kachniarz

  2. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warsaw, Poland

    Andrzej Szałas

Authors
  1. Jarosław Kachniarz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Szałas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Telecommunications, ul. Szachowa 1, 04-894, Warsaw, Poland

    Ewa Orłowska

  2. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kachniarz, J., Szałas, A. (2001). On a Static Verification of Integrity Constraints in Relational Databases. In: Orłowska, E., Szałas, A. (eds) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol 65. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1828-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1828-4_6

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-662-00362-6

  • Online ISBN: 978-3-7908-1828-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation