On generating database schemes bounded or constant-time-maintainable by extensibility (Q1092683): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:10, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On generating database schemes bounded or constant-time-maintainable by extensibility |
scientific article |
Statements
On generating database schemes bounded or constant-time-maintainable by extensibility (English)
0 references
1988
0 references
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.
0 references
bounded database schemes
0 references
extensibility
0 references
constant-time-maintainable database schemes
0 references