Differential checkpointing for reducing memory requirements in optimized SOAP deserialization

Abstract

Differential serialization (DDS) is a SOAP optimization technique wherein servers save checkpoints and parser states associated with portions of previously received messages, and use them to avoid full parsing and deserialization of similar new messages. In this paper, we characterize DDS's memory requirements and memory overhead, introduce a new technique for storing only the differences between successive parser states for a message, and demonstrate how this optimization, which we call differential checkpointing, speeds up the DDS optimization and reduces its memory requirements.