Deferred Maintenance of Replicated 0 b ject s in Single-Site Databases
Jukka Teuhola · 1996
Replacatzon of database objects as here suggested as means of enhanczng performance an cases where conPzctang preferences for clusterzng occur, such as an the storage of many-to-many relataonshzps. A novel f eature zs lazy propagataon of updates: The przmary objects are kept up-to-date, but an obsolete replaca as not updated untd at is next retrzeved. The core of the method as a maan-memory hash table, contaanang tamestamps of pramary objects. Replacataon causes almost no overhead an regard to updates, concurrency or recovery. Yet, the retrzeval speed can be consaderably ancreased. Replzcatzon should be applaed only for cratacal, read-intensave object types, to g am actual advantage from redundancy, compensatang the storage penalty. Our scheme could be used for amplementang materaalazed mews an relataonal databases. However, the method as descrzbed an terms of poznter-based archatectures.