On designing database schemes bounded or constant-time maintainable with respect to functional dependencies

  • Authors:

  • E. P. F. Chan;H. J. Hernandez

  • Affiliations:

  • Department of Computmg Science, The University of Alberta, Edmonton, Alberta, Canada T6G 2H1;Department of Computmg Science, The University of Alberta, Edmonton, Alberta, Canada T6G 2H1

  • Venue:
  • PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

Under the weak instance model, to determine if a class of database schemes is bounded with respect to dependencies is fundamental for the analysis of the behavior of the class of database schemes with respect to query processing and updates. However, proving that a class of database schemes is bounded with respect to dependencies seems to be very difficult even for restricted cases. To resolve this problem, we need to develop techniques for characterizing bounded database schemesIn this paper, we give a formal methodology for designing database schemes bounded with respect to functional dependencies using a new technique called extensibility. This methodology can also be used to design constant-time-maintainable database schemes