[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Compile a transformation description into a largenumber of

  • From: Rick Jelliffe <rjelliffe@allette.com.au>
  • To: "Costello, Roger L." <costello@mitre.org>
  • Date: Fri, 21 Dec 2018 04:12:59 +1100

Re:  Compile a transformation description into a largenumber of
Map Reduce?

Rather than  a chain of Transform, you can go one step more detailed and have a chain of Map-Reduce pairs.  It didn't seem to do Google any harm.

But I associate the attempts to define typical operations with ETL and spreadsheets, where it comes a cropper when you don't have uniform data, or you have problematic data, or semi-structured rather than tabular data.

Rick

On Fri, Dec 21, 2018 at 2:50 AM Costello, Roger L. <costello@mitre.org> wrote:

Hi Folks,

This is a brainstorm, research kind of question …

As you know, every action that a user takes on a computer follows the same paradigm: Code gets compiled into a large number of very simple machine instructions (add, subtract, compare, load, store, etc.) which are then executed at blazing speeds by the computer’s processor.

Can that paradigm be emulated, at a higher level, to translate one XML vocabulary to another?

Allow me to explain …

Is there some small set of very simple operations that, when combined, can translate any XML vocabulary to another?

You might argue that XSLT is designed for transformations, which is true. But I would argue that the set of operations provided even by XSLT 1.0 is hardly akin to the level of simplicity provided by machine operations. I am thinking of a much simpler and smaller set of operations than XSLT provides. Perhaps a small subset of XSLT?

I envision a compiler that takes as input a declarative description of the rules for translating XML vocabulary 1 to XML vocabulary 2. The compiler outputs a large number of very simple transformation operations.

That collection of operations is given to a processor (perhaps an XSLT processor?) along with data (i.e., an instance of XML vocabulary 1).

The result of processing is an instance of XML vocabulary 2.

In other words, it follows the same paradigm as ordinary computer usage – compile code to a large set of very simple operations – but at a much higher level.

The benefit? The same benefit as with ordinary computer usage: Users can work at higher levels of abstraction. Possibly the “transformation description” box shown above could be much more declarative than, say, a full-fledged XSLT program that transforms vocabulary 1 to vocabulary 2.

Have you thought of such things? Is there a small subset of very simple XSLT operations that can perform any transformation? Stated another way, is there a small subset of very simple XSLT operations that is “Turing Complete”? Have you ever created a compiler to output a large number of these very simple transform operations?

/Roger



[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index]


PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
 

Stylus Studio has published XML-DEV in RSS and ATOM formats, enabling users to easily subcribe to the list from their preferred news reader application.


Stylus Studio Sponsored Links are added links designed to provide related and additional information to the visitors of this website. they were not included by the author in the initial post. To view the content without the Sponsor Links please click here.

Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.