Skip to Content

Changes for page 13 Structure Mapping

Last modified by Helena on 2025/09/10 11:19
From version 10.10
edited by Helena
on 2025/05/16 09:18
Change comment: There is no comment for this version
To version 10.8
edited by Helena
on 2025/05/16 09:15
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -132,26 +132,24 @@
132 132  
133 133  A Representation Map mapping ISO 2-character to ISO 3-character Codelists would take the following form:
134 134  
135 -(% style="width:763.294px" %)
136 -|(% style="width:252px" %)**CL_ISO_ALPHA2**|(% style="width:508px" %)**CL_ISO_ALPHA3**
137 -|(% style="width:252px" %)AF|(% style="width:508px" %)AFG
138 -|(% style="width:252px" %)AL|(% style="width:508px" %)ALB
139 -|(% style="width:252px" %)DZ|(% style="width:508px" %)DZA
140 -|(% style="width:252px" %)AS|(% style="width:508px" %)ASM
141 -|(% style="width:252px" %)AD|(% style="width:508px" %)AND
142 -|(% style="width:252px" %)etc…|(% style="width:508px" %)
135 +|CL_ISO_ALPHA2|CL_ISO_ALPHA3
136 +|AF|AFG
137 +|AL|ALB
138 +|DZ|DZA
139 +|AS|ASM
140 +|AD|AND
141 +|etc…|
143 143  
144 144  A Representation Map mapping free text country names to an ISO 2-character Codelist could be similarly described:
145 145  
146 -(% style="width:770.294px" %)
147 -|(% style="width:247px" %)**Text**|(% style="width:520px" %)**CL_ISO_ALPHA2**
148 -|(% style="width:247px" %)"Germany"|(% style="width:520px" %)DE
149 -|(% style="width:247px" %)"France"|(% style="width:520px" %)FR
150 -|(% style="width:247px" %)"United Kingdom"|(% style="width:520px" %)GB
151 -|(% style="width:247px" %)"Great Britain"|(% style="width:520px" %)GB
152 -|(% style="width:247px" %)"Ireland"|(% style="width:520px" %)IE
153 -|(% style="width:247px" %)"Eire"|(% style="width:520px" %)IE
154 -|(% style="width:247px" %)etc…|(% style="width:520px" %)
145 +|Text|CL_ISO_ALPHA2
146 +|"Germany"|DE
147 +|"France"|FR
148 +|"United Kingdom"|GB
149 +|"Great Britain"|GB
150 +|"Ireland"|IE
151 +|"Eire"|IE
152 +|etc…|
155 155  
156 156  Valuelists, introduced in SDMX 3.0, are equivalent to Codelists but allow the maintenance of non-SDMX identifiers. Importantly, their IDs do not need to conform to IDType, but as a consequence are not Identifiable.
157 157  
... ... @@ -159,11 +159,10 @@
159 159  
160 160  In common with Codelists, each item in a Valuelist has a multilingual name giving it a human-readable label and an optional description. For example:
161 161  
162 -(% style="width:780.294px" %)
163 -|(% style="width:126px" %)**Value**|(% style="width:153px" %)**Locale**|(% style="width:498px" %)**Name**
164 -|(% style="width:126px" %)$|(% style="width:153px" %)en|(% style="width:498px" %)United States Dollar
165 -|(% style="width:126px" %)%|(% style="width:153px" %)En|(% style="width:498px" %)Percentage
166 -|(% style="width:126px" %) |(% style="width:153px" %)fr|(% style="width:498px" %)Pourcentage
160 +|Value|Locale|Name
161 +|$|en|United States Dollar
162 +|%|En|Percentage
163 +| |fr|Pourcentage
167 167  
168 168  Other characteristics of Representation Maps:
169 169  
... ... @@ -187,31 +187,30 @@
187 187  
188 188  Below is an example set of regular expression rules for a particular component.
189 189  
190 -(% style="width:708.294px" %)
191 -|(% style="width:133px" %)**Regex**|(% style="width:377px" %)**Description**|(% style="width:194px" %)**Output**
192 -|(% style="width:133px" %)A|(% style="width:377px" %)Rule match if input = 'A'|(% style="width:194px" %)OUT_A
193 -|(% style="width:133px" %)^[A-G]|(% style="width:377px" %)Rule match if the input starts with letters A to G|(% style="width:194px" %)OUT_B
194 -|(% style="width:133px" %)A~|B|(% style="width:377px" %)Rule match if input is either 'A' or 'B'|(% style="width:194px" %)OUT_C
187 +|Regex|Description|Output
188 +|A|Rule match if input = 'A'|OUT_A
189 +|^[A-G]|Rule match if the input starts with letters A to G|OUT_B
190 +|A~|B|Rule match if input is either 'A' or 'B'|OUT_C
195 195  
196 196  Like all mapping rules, the output is either a Code, a Value or free text depending on the representation of the Component in the target Data Structure Definition.
197 197  
198 198  If the regular expression contains capture groups, these can be used in the definition of the output value, by specifying \//**n** //as an output value where //**n**// is the number of the capture group starting from 1. For example
199 199  
200 -(% style="width:720.294px" %)
201 -|(% style="width:199px" %)**Regex**|(% style="width:126px" %)**Target output**|(% style="width:192px" %)**Example Input**|(% style="width:200px" %)**Example Output**
202 -|(% style="width:199px" %)(((
203 -([0-9]{4})[0-9]([0-9]{1})
204 -)))|(% style="width:126px" %)\1-Q\2|(% style="width:192px" %)200933|(% style="width:200px" %)2009-Q3
196 +|Regex|Target output|Example Input|Example Output
197 +|(((
198 +([0-9]{4})[0-
205 205  
200 +9]([0-9]{1})
201 +)))|\1-Q\2|200933|2009-Q3
202 +
206 206  As regular expression rules can be used as a general catch-all if nothing else matches, the ordering of the rules is important. Rules should be tested starting with the highest priority, moving down the list until a match is found.
207 207  
208 208  The following example shows this:
209 209  
210 -(% style="width:725.294px" %)
211 -|(% style="width:198px" %)**Priority**|(% style="width:148px" %)**Regex**|(% style="width:212px" %)**Description**|(% style="width:164px" %)**Output**
212 -|(% style="width:198px" %)1|(% style="width:148px" %)A|(% style="width:212px" %)Rule match if input = 'A'|(% style="width:164px" %)OUT_A
213 -|(% style="width:198px" %)2|(% style="width:148px" %)B|(% style="width:212px" %)Rule match if input = 'B'|(% style="width:164px" %)OUT_B
214 -|(% style="width:198px" %)3|(% style="width:148px" %)[A-Z]|(% style="width:212px" %)Any character A-Z|(% style="width:164px" %)OUT_C
207 +|Priority|Regex|Description|Output
208 +|1|A|Rule match if input = 'A'|OUT_A
209 +|2|B|Rule match if input = 'B'|OUT_B
210 +|3|[A-Z]|Any character A-Z|OUT_C
215 215  
216 216  The input 'A' matches both the first and the last rule, but the first takes precedence having the higher priority. The output is OUT_A.
217 217  
... ... @@ -223,10 +223,9 @@
223 223  
224 224  For instance:
225 225  
226 -(% style="width:742.294px" %)
227 -|(% style="width:191px" %)**Input String**|(% style="width:154px" %)**Start**|(% style="width:211px" %)**Length**|(% style="width:182px" %)**Output**
228 -|(% style="width:191px" %)ABC_DEF_XYZ|(% style="width:154px" %)5|(% style="width:211px" %)3|(% style="width:182px" %)DEF
229 -|(% style="width:191px" %)XULADS|(% style="width:154px" %)1|(% style="width:211px" %)2|(% style="width:182px" %)XU
222 +|Input String|Start|Length|Output
223 +|ABC_DEF_XYZ|5|3|DEF
224 +|XULADS|1|2|XU
230 230  
231 231  Sub-strings can therefore be used for the conceptual rule //If starts with 'XU' map to Y// as shown in the following example:
232 232