The DLQ handler rules table

The dead-letter queue handler rules table defines how the DLQ handler processes messages that arrive on the DLQ.

There are two types of entry in a rules table:

  • The first entry in the table, which is optional, contains control data.
  • All other entries in the table are rules for the DLQ handler to follow. Each rule consists of a pattern (a set of message characteristics) that a message is matched against, and an action to be taken when a message on the DLQ matches the specified pattern. There must be at least one rule in a rules table.

Each entry in the rules table comprises one or more keywords.

  • DLQ control data
    We can include keywords in a control-data entry in a dead-letter queue handler rules table.
  • DLQ rules (patterns and actions)
    A description of the pattern-matching keywords (those against which messages on the dead-letter queue are matched), and the action keywords (those that determine how the DLQ handler is to process a matching message). An example rule is also provided.
  • DLQ rules table conventions
    The syntax, structure and contents of the dead-letter queue handler rules table must adhere to these conventions.

Parent topic: Processing messages on an IBM MQ dead-letter queue


Related information