On generating database schemes bounded or constant-time-maintainable by extensibility (Q1092683)

Under the weak instance model, determining whether a class of database schemes is bounded (with respect to dependencies or with respect to consistency) 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 seems to be very difficult even for restricted cases. To resolve this problem, we need to develop techniques or to explore outer ideas for characterizing bounded database schemes. In particular, the idea of generating bounded database schemes is completely unexplored. In this paper, we give a formal methodology for the generation of bounded database schemes using a new technique called extensibility. This methodology can also be used to generate constant-time-maintainable database schemes.