This wiki has undergone a migration to Confluence found Here

Difference between revisions of "Answers from CAF Simplification project"

From HL7Wiki
Jump to navigation Jump to search
Line 1: Line 1:
Here are provisional answers to the 12 questions asked on the parent wiki page for simplification projects, as suggested by the [[Simplification in the UK|UK CAF simplification project]]:
+
Here are provisional answers to the 12 questions asked on the [[SimplifiedV3andCDA|parent wiki page for simplification projects]], as suggested by the [[Simplification in the UK|UK CAF simplification project]]:
  
  

Revision as of 19:15, 20 February 2011

Here are provisional answers to the 12 questions asked on the parent wiki page for simplification projects, as suggested by the UK CAF simplification project:


Q: What practical methods and tools exist today for fast-track implementation of V3 and CDA exchanges? What is their current status, scope, and experience with their use?

A: The tools being used in the UK give automated support for the steps needed to define a simplified V3 or CDA message. They are currently being piloted on the CAF simplification project.


Q: How much can be achieved with these methods, in terms of reduced XML complexity, implementation effort, learning time, or any other metrics?

A: We cannot yet quantify the savings in implementations effort. There is a big saving in learning time for those who are not familiar with V3 or CDA, because simplified messages can be implemmented with vanilla XML tools and techniques. The simplified XML is about three times smaller and a lot easier to read; there is reason to believe that for closed domains, the simplified XML should be 'as good as it gets'.


Q: Are they to be regarded only as a fast route to implementing the full messages, or are there cases where the simplified XML forms can be exchanged over the wire? What are the benefits and drawbacks, and what would be needed to make it acceptable?

A: Primarily they are a simplified implementation technique. However, provided there are reliable transforms in both directions, there seems to be no harm in using the simplified XML over the wire. Suppliers do not have to support two different formats, as they can use the transforms to get to whichever one they prefer.


Q: Is it necessary for a full round-trip (full=>simplified=> full) to be automatically and reliably supported by transforms?

A: It is highly desirable, so that all parties can be coinfident that full and simplified forms are completely equivalent, and can use which one they prefer.


Q: Is it useful to define simplified XML forms for closed sub-domains of CDA and V3 domains, or should the definitions have some of the semantic openness of full V3 and CDA? Can this be done consistent with full round-trips?

A: Closed sub-domains get you a long way. Having open-ended semantics opens up a lot of complexity for senders and receivers, and should be avoided where possible. But if you need it, simplified messages could be made open-ended by including any open-ended pieces in the V3 namespace, and not trying to simplify them. This would round-trip satisfactorily.


Q: How are the semantic relations between simplified XML and RIM-based semantic models to be defined and recorded?

A: These semantic relations are mappings, so it is sensible to use the Neutral Mapping notation, as supported by the simplification tools. It is important to publish the mappings, because they are an unambiguous definition of the RIM-based semantics of the simplified messages. But it would also be useful to publish a standalone definition of the simplified message semantics, for RIM non-experts.


Q: What is the process for developing a simplified V3 or CDA definition, the transforms between the simplified and full forms, and the semantic relations between them? What tools support the process? How automated and reliable is the process?

A: The process is described in the project wiki page. It involves marking up the full message tree to say which leaf nodes you need to retain, and giving business names for nodes. Then the tools do the rest automatically. This means that the schemas, mappings and transforms are reliable. It also means you can iterate the definition of a simplified message fairly rapidly - you don't have to go back and adjust the transforms by hand, as the tools will do it.


Q: What are the processes for testing a simplified V3 or CDA form, both in its definition and in deployment?

A: The simplification tools have facilities for testing the transforms and round-trips, with a fairly high level of automation. But is it up to any simplification project to find enough good test cases and test messages. Test coverage is hard in any project.


Q: What are the processes for maintaining the definitions of simplified forms through successive versions, as requirements change or as the underlying HL7 definitions evolve through versions?

A: We are into unknown territory here. But to make maintenance and evolution feasible, a high degree of automation in the tools is almost certainly necessary. When maintaining software, we take the automation of compilers for granted. Re-creating transforms by hand for each new release would be infeasible and unreliable.


Q: Are there other artifacts, such as simplified domain models , which can usefully be developed in tandem with the simplified XML forms?

A: The simplified domain models have several other uses - such as validation with domain experts, who can understand them better than RIM-based models. You can also map systems and databases onto the simplified models, for reporting and data comparisons acroos several systems.


Q: What should be the full ‘kit of parts’ in an implementation guide for a simplified form?

A: It should include at least schemas, example messages, transforms, and mappings. We will learn over time what else it needs.


Q: Can these ‘simplification methodologies’ be applied equally well to the other HL7 content models (messages and SOA content models)?

A: The simplification tools are applicable to V3 messages. There is no reason why they should not be more widely applicable; but no doubt there will need to be tool extensions for particular use cases.