Modules of PSWEEP Algorithm

?R

Data Warehouse

?V

V

?R, i, t

Update View

AssignTimeStamp

UMQ

?R, i, t

?R, i, t

PPU

RPU

DU

Q

DU

QR

DU

DU

DU

DU

?V

Information Source

R

ProcessQuery

SendUpdate

DU

DU

QR’

Q’

DU

Query

QueryResult

DataUpdate

FIFO

QR

Q

QR

Legend

Data

Storage

(Queue/Set)

Database

Process

Data Flow

Multi-

Threaded

Data

Previous slide

Next slide

Back to first slide

View graphic version

Here, the QueryResult and DataUpdate are two timestamped Elements.

In this way, we can already solve the FIFO network assumption. By reducing the assumption to make the wrapper at the IS can assign the timestamp on it. And the message with later stamp will include the effect of the message with earlier stamp.

So, I don’t need the network to be FIFO. I can simplify the implementation of the FIFO channel

Need to mention the Local Compensation in the View change Module..