UML25 — UML 2.5 Beta 1 9.5.3 Qualifiers

The description of qualifiers in section 9.5.3 is unclear.
I'm really struggling to understand it. The second paragraph
in particular seems to unnecessarily divide qualifiers by
the opposite end multiplicity. (In fact opposite ends, but
the opposite end is for binary associations only.) I have
no idea why this hints at implementation issues. Likewise
why does the note mention tables and indices? It shouldn't
be a note as it's a constraint on the multiplicity given
the qualifier values.

Here is an alternative explanation to replace all three
paragraphs:

A qualified Association end has qualifiers that partition
the instances associated with an instance at that end, the
qualified instance. Each partition is designated by a qualifier
value, which is a tuple comprising one value for each qualifier.
The multiplicities at the other ends of the association
determine the number of instances in each partition. So, for
example, 0..1 means there is at most one instance per qualifier
value. If the lower bounds are non-zero, the qualifier values
must be a finite set, for example, the qualifiers are typed by
enumerations.

accept suggestion