Possible Future Extensions

• Event aggregation i.e. where separate events are grouped together and subsequently written out as a single event.

• Incorporate TCA as a hardwired subprocessor. There is a heavy overlap with TCA (see section 7.1). RAA is more powerful as it has access to the full event data structure, but TCA is fully data driven. TCA might be used as the event aggregation builder.

• Summary overflows to disk. RAA currently requires sufficient memory to hold all summary records in memory together. For small summary record and file sizes this should not be a problem but, in abnormal circumstances, this could be could require an excessive /Z/ memory. A solution would be to organise the summary records into blocks and page out unused ones to disk. As most search patterns are sequential a simple buffer caching system should ensure only a small drop in performance. The interface to this scheme already exists (RAA_SRM_LIFT), but this is significant work and will not be implemented until there is a demonstrated need for it.