SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 22 / Issue 1

SIAM J. Comput. 22, pp. 29-45 (17 pages)

On the Boundedness of Constant-Time-Maintainable Database Schemes

Héctor J. Hernández and Ke Wang

Full Text: Download PDF | Buy PDF (US$25) | View Cart
Constant-time-maintainable database schemes are highly desirable with respect to constraint enforcement, since it is possible to determine whether any of their consistent states plus an inserted tuple is consistent in time independent of the state size. Several proper subclasses of constant-time-maintainable database schemes are known to be bounded with respect to dependencies and hence very desirable with respect to query answering. However, whether the whole class of constant-time-maintainable database schemes is bounded is not known for sure.
In this paper, it is proven that the entire class of constant-time-maintainable database schemes is bounded with respect to dependencies and thus very desirable with respect to query answering in the following cases: (1) only cover-embedded functional dependencies appear as constraints; (2) only equality-generating dependencies appear as constraints and the database scheme has a lossless join. In particular, it is shown that total projections of representative instances can be computed via unions of projections of simple chase join expressions. Since it is known how to optimize these expressions, it is possible to compute total projections optimally. These results show that the class of constant-time-maintainable database schemes is the largest class of database schemes, which are highly desirable with respect to both constraint enforcement and query answering. This class of schemes can be effectively recognized by known algorithms. The previously known largest class of database schemes with these desirable properties is the class of independent database schemes, which is a proper subclass of constant-time-maintainable schemes.

© 1993 Society for Industrial and Applied Mathematics

KEYWORDS

AMS Subject Headings

68P15, 68Q

PUBLICATION DATA

ISSN

0097-5397 (print)  
1095-7111 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received May 15, 1990
Accepted June 05, 1991
Digital Object Identifier
http://dx.doi.org/10.1137/0222003

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. On the Boundedness of Constant-Time-Maintainable Database Schemes
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close