Skip to main content
SpringerLink
Log in

Database survivability under dynamic constraints

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The connection between static constraints satisfied by a database and its future evolution under dynamic constraints is investigated using the notions of survivability and survivability-closure. The static constraints considered here are functional dependencies (fd's). The dynamic constraints are restricted to commonly arising analogs of fd's, called “dynamic” fd's. The results provide new tools for the design of database schemes containing both static and dynamic constraints.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Armstrong, V.W.: Dependency structures of database relationships. Proc. IFIP '74. pp. 580–583. Amsterdam: North-Holland 1974

    Google Scholar 

  2. Beeri, Dowd, M., Fagin, R., Statman, R.: On the structure of Armstrong relations for functional dependencies. IBM Research Report RJ290 (Sept. 1980), San Jose, CA

  3. Beeri, C, Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations, pp. 47–61. Proc. ACM SIGMOD Intl. Conf. on the Mgmt. of Data. Toronto (May 1977)

  4. Brodie, M.: On modelling behavioral semantics of databases, pp. 32–42. Proc. 7th Intl. Conf. on Very Large Data Bases (1981)

  5. Casanova, M.A., Furtado, A.L.: A family of temporal languages for the description of transition constraints. In: Advances in Database Theory Vol. II. H. Gallaire, J. Minker, J-M. Nicolas (eds.) New York: Plenum Press 1985

    Google Scholar 

  6. Castilho, I.M.V., Casanova, M.A., Furtado, A.L.: A temporal framework for database specifications, pp. 280–291. Proc. 8th Intl. Conf. on Very Large Data Bases (1982)

  7. Codd, E.F.: Further normalization of the database relational model. In: Courant Computer Science Symposia 6: Database Systems. pp. 33–64. Englewood Cliffs, NJ: Prentice-Hall 1971

    Google Scholar 

  8. Ceri, S., Pelagatti, G., Bracchi, G.: Structured methodology for designing static and dynamic aspects of database applications. Inf. Syst. 6, 31–45 (1981)

    Article  Google Scholar 

  9. Clifford, J., Warren, D.S.: Formal semantics for time in databases. ACM Trans. Database Syst. 8, 214–254 (1983)

    Article  Google Scholar 

  10. .De Antonellis, V., Zonta, B.: Modelling events in database applications design. pp. 23–31. Proc. 7th Intl. Conf. on Very Large Data Bases (1981)

  11. Fagin, R.: Horn clauses and database dependencies. J. ACM 29, 952–985 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  12. Fagin, R.: Functional dependencies in a relational database and propositional logic. IBM J. Res. Dev. 21, 534–544 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gallaire, H.: Impacts of logic on databases. pp. 248–259. Proc. 7th Intl. Conf. on Very Large Data Bases 1981

  14. Ginsburg, S., Hull, R.: Characterizations for functional dependency and Boyce-Codd normal form families. J. Theoret. Comput. Sci. 26, 243–286 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ginsburg, S., Zaiddan, S.M.: Properties of functional dependency families. J. ACM 29, 678–698 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Harrison, M.: Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesely 1978

    MATH  Google Scholar 

  17. Hull, R.: Finitely specifiable implicational dependency families. J. ACM 31, 210–226 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hammer, M., McLeod, D.J.: Semantic integrity in a relational data base system. Proc. 1st Intl. Conf. on Very Large Data Bases 1975

  19. Maier, D.: The Theory of Relational Databases. Rockville, MD: Computer Science Press 1983

    MATH  Google Scholar 

  20. Nicolas, J.M., Yazdanian, N.: Integrity checking in deductive data bases. From Logic and Databases (H. Gallaire, J. Minker eds.). New York: Plenum Press 1978

    Google Scholar 

  21. Post, E.L.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52, 264–268 (1946)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ullman, J.: Principles of Database Systems. Rockville, MD: Computer Science Press 1980

    MATH  Google Scholar 

  23. Vianu, V.: Dynamic constraints and database evolution. Proc. Second ACM SIGACT-SIGMOD Symp. on Principles of Database Systems 1983

  24. Vianu, V.: Dynamic functional dependencies and database again. J. ACM 34, 28–59 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, C-014, University of California at San Diego, 92093, La Jolla, California

    Victor Vianu

Authors
  1. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Portions of this paper appeared in “Dynamic Constraints and Database Evolution”, Ph.D. Thesis, University of Southern California, 1983

The author was supported in part by the National Science Foundation under grant number MCS-7925004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vianu, V. Database survivability under dynamic constraints. Acta Informatica 25, 55–84 (1988). https://doi.org/10.1007/BF00268845

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00268845

Keywords

Search

Navigation