LIGHT-WEIGHT CONCURRENCY CONTROL IN PARALLELIZED VIEW MAINTENANCE

摘要

Aspects relate to maintaining, with a concurrent plurality of view managers, an aggregate view record that is derived from base data being updated. The aggregate view record is stored in a storage device. In a first example, a given base data update is propagated by one of the view managers reading a value from the aggregate view record and a sequence number, determining an updated value using the base data update, and submitting the updated value for writing, with the sequence number. The sequence number submitted with the writing is compared to a then-current sequence number stored in the storage device, and if there is a mismatch, then the view manager repeats the reading, determining, and submitting until there is no mismatch. A number of variations exist for different types of aggregates, which include counting, averaging, summing, and tracking minima and maxima. The concurrency mechanism is more easily scaled than a full ACID transaction model, which blocks both read transactions and write transactions until another transaction completes.