Performance Evaluation of PSWEEP
Worst Case of PSWEEP is Same as SWEEP
PSWEEP Gains Up To k Folds Performance of SWEEP, k = min(p, m*q)
PSWEEP is More Efficient than SWEEP When:
- Information Sources Process Queries in Parallel
- Data Updates Happened Continuously
- Data Updates Happened in Large Quantity