Incremental database design revisited

  • Ke Wang
  • Li Yan Yuan
Databases And Information Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)


Three new classes of database schemes are defined. The class of weakly independent schemes is a generalization of independent schemes in a centralized environment. The classes of expansion-chased schemes and simple chase join bounded schemes are aimed at capturing the behaviour of the chase process by a static structure, i.e., derivation sequences of relation schemes. We first present a study on containment relationships among various classes of database schemes, which establishes the generality and desirability of these new classes. We then show that the new classes and the class of algebraic-maintainable schemes can be incrementally designed via a known scheme generating method.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AC]
    P. Atzeni and E.P.F. Chan, "Efficient optimization of simple chase join expressions," ACM TODS, Vol. 14, No. 2 (1989), pp. 212–230CrossRefGoogle Scholar
  2. [C]
    E.P.F. Chan, "Optimal computation of total projections with unions of simple chase join expressions," ACM SIGMOD 1984, pp. 149–163Google Scholar
  3. [CH1]
    E.P.F. Chan and H.J. Hernandez, "Independence-reducible database schemes," to appear in JACM (An extended abstract appeared under the same title in ACM PODS 1988, pp. 163–173)Google Scholar
  4. [CH2]
    E.P.F. Chan and H.J. Hernandez, "On generating database schemes bounded or constant-time-maintainable by extensibility," Acta Informatica, 25, (1988), pp. 475–496Google Scholar
  5. [G]
    M.H. Graham, "Path expressions in databases," ACM PODS 1983, pp. 366–378Google Scholar
  6. [GV]
    M.H. Graham and M.Y. Vardi, "On the complexity and axiomatizability of consistent database states," ACM PODS 1984, pp. 281–289Google Scholar
  7. [GW]
    M.H. Graham and K. Wang, "Constant time maintenance or the triumph of fd's," ACM PODS 1986, pp. 121–141Google Scholar
  8. [GY]
    M.H. Graham and M. Yannakakis, "Independent database schemes," JCSS, 28, 1, 1984, pp. 121–141Google Scholar
  9. [H]
    P. Honeyman, "Test satisfaction of functional dependencies," JACM, 29, 3, 1982, pp. 668–677CrossRefGoogle Scholar
  10. [HW]
    H.J. Hernandez and K. Wang, "On the boundedness of constant-time-maintainable database schemes," submitted to publication, 1989Google Scholar
  11. [IIK]
    M. Ito, M. Iwasaki and T. Kasam, "Some results on the representative instances in relational databases," SIAM J. Comput., Vol. 14, No. 2, (May, 1985), pp. 334–353CrossRefGoogle Scholar
  12. [M]
    A.O. Mendelzon, "Database states and their tableaux," ACM TODS, Vol. 9, No. 2, pp. 264–282Google Scholar
  13. [Ma]
    D. Maier, The theory of relational databases, CSP Inc., 1983Google Scholar
  14. [MMS]
    D. Maier, J.D. Ullman, Y. Sagiv, "Testing implication of data dependencies," ACM TODS, Vol. 4, No. 4, (1979), pp. 455–469CrossRefGoogle Scholar
  15. [MUV]
    D. Maier, J.D. Ullman, M.Y. Vardi, "On the foundations of the universal relation model," ACM TODS, Vol. 9, No. 2, (1984), pp. 283–308CrossRefGoogle Scholar
  16. [S]
    Y. Sagiv, "A characterization of globally consistent databases and their correct access pathes," ACM TODS, Vol. 8, No., 2, (1983), pp. 266–286CrossRefGoogle Scholar
  17. [U]
    J.D. Ullman, Principles of database systems, CSP, Inc., 1982Google Scholar
  18. [W]
    K. Wang, "Can constant-time-maintainability be more practically useful?" ACM PODS 1989, pp. 120–127Google Scholar
  19. [WG]
    K. Wang and M.H. Graham, "Constant-time-maintainability: a generalization of independence," submitted to publication, 1988 (See [GW] for an extended abstract)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ke Wang
    • 1
  • Li Yan Yuan
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations