Changes between Initial Version and Version 1 of RdsWipWorldView/ReductionMapping

09/02/08 21:41:06 (16 years ago)
jbourne (IP:



  • RdsWipWorldView/ReductionMapping

    v0 v1  
     3NB! Make sure that you follow the guidelines: 
     8= POSC-Caesar FIATECH IDS-ADI Projects = 
     9== Intelligent Data Sets Accelerating Deployment of ISO15926 == 
     10== ''Realizing Open Information Interoperability'' == 
     14= Automated Mapping: Reduction to a Common Base Set = 
     16One of the paths to interoperability that can be explored 
     17is that of a set of generated mappings for any given point 
     18to point integration. 
     20== Requirements == 
     22The requirement is that both reference data sets can be reduced 
     23to a common base set of relations via rule-based means using 
     24a single rule language. 
     26== Limitations == 
     28The main limitation is that for many sets of coarse-to-fine 
     29generated reference data, it is highly unlikely that a rule 
     30language will actually be able to be used to reduce the entire 
     31set of original reference data down to a common base set that 
     32is consistent enough to be able to perform analysis and reasoning 
     33upon, which is likely to be a pre-requisite for being able to 
     34generate the the mapping. 
     36== Accommodation == 
     38Since this likely limitation can be recognized at the outset, 
     39it would be worthwhile investing in techniques that can ensure 
     40for example, that a coarse-to-fine generated reference data set 
     41(such as one based on a linguistic approach) is reducible to 
     42a consistent first-order logic model.  With this accommodation 
     43in place the risk of not being able to generate mappings 
     44could be somewhat ameliorated. 
     46== Fidelity == 
     48Fidelity is another area that could suffer with such an approach, 
     49however, not more so particularly than with any other mapping 
     50mechanism though.  Again, if a methodology can be devised which drives 
     51explicitness and precision in the definition of such a reference 
     52data set, then the fidelity problems can be circumvented to 
     53some degree. 
     55== Cost == 
     57Generating mappings from a rule language can substantially 
     58reduce the '''cost''' of translating in a peer-to-peer or 
     59spoke-to-hub scenario, especially if it is late binding. 
     61== Approach == 
     6399% of the definitions that will be imported into the WIP from 
     64existing sources will have been arrived at through coarse-to-fine 
     65approaches, and 99% of those again will have no longhands (ie. base relation derivations) to start with. 
     67So the RDS/WIP then becomes a crucial environment for people to 
     68collaboratively develop these base derivations.  As formerly 
     69mentioned, many will not be logically consistent, at least in 
     70the first order logic sense, but that knowledge at least allows 
     71the user to scope and cost that aspect of the integration 
     72exercise - knowing that some percentage will require special 
     75== Conclusions == 
     77Being able to do this at all is predicated on the idea that imperfect 
     78(that is to say, unexpanded and/or illogical) predicates must be able 
     79to be present in the RDS/WIP. 
About PCA
Reference Data Services