Home > Articles > Web Services > XML

This chapter is from the book


The previous discussion concentrated primarily on the composition from relational data to XML data. In the case of shredded XML, we must first solve the opposite problem: How do we take XML data and represent it in a relational database? Stated another way, How do we encode an XML document as a set of relational entities, relations, and attributes?

The issues involved for shredding are very similar to the issues for update for any composed mapping technique, which is not surprising, given that shredding an XML document is essentially an update operation that adds a new instance of the document to the store. Thus it is also not surprising that the same basic approaches that work for composed mapping techniques work for shredding as well—so long as they preserve the ability to update. In this section we explore a few additional issues that are unique to shredding.

Creation of the Database

First, when XML is being composed from relational data, we normally assume that the relational data already exists. That is, either the tables and schemas for the relational data have already been created for some other application, or else some application designer has expressly created tables for storing XML data—but in either case, the act of designing and installing the tables has been accomplished before we consider the details of how to map those tables to XML. With shredding, the opposite is usually the case. Initially we are presented with XML files, a DTD, or an XML schema, and we have to design and install the tables and columns that will hold the corresponding data.

Thus shredding always begins with a “design” or “registration” step, in which the database structures to hold the XML are actually created. Different vendors have different approaches to this. The process can be completely automated and implicit (analogous to a default mapping, but the other way around), or an explicit technique can be used to guide the creation of the table layout. Ideally, but not always, the same composition technique (e.g., annotated template) can be used to accomplish both shredding and (re)composition. An explicit composition technique may include additional content to provide instructions for things like precise mapping of datatypes or definition of table keys, foreign keys, and indices.

Adding Extra Information to the Composition

One difference between shredding and general composition techniques is that a shredding implementation has the opportunity to store extra “hidden” information that it derives while parsing an XML document. For example, it is possible to assign a unique, internal identifier (a GUID or row-id) to some or all nodes in an XML document and then use these identifiers as keys when generating hierarchy through joins, rather than insisting on the existence of some key in the XML itself. This makes it possible to reliably represent, and update, XML data that may contain duplicates, for example. (Note: It might be tempting to use XML ID attributes for this purpose, if they are present, but that is generally a bad idea, because (1) many applications will not validate that IDs are in fact unique within a document, and (2) IDs only need to be unique within a single document, and most applications need to manage multiple XML documents in the same database.)

In addition to identifiers for nodes, ordinal values (the position of a node within its parent) can be extracted and stored. Preserving order in XML documents can be a complex task otherwise and may even be impossible in some cases (e.g., arbitrarily interleaved lists of different types of elements). Care must be taken with the representation of the ordinal value if update is required (while a simple numeric index would work, the computational cost of inserting a new node into the document would be significant).

Inlining and Consolidation

Shredding involves two basic table layout choices: when to break information across multiple tables and when to consolidate tables for different elements. A simple algorithm for defining the database layout starts at the top of the XML document, with a root element (or set of possible root elements). The element is associated with a table, and then, for each of the possible children of that element, a decision is made whether to put them in the same table (inlining), or start a new table (and either find in the XML data, or create artificially, a field or fields that will be the join condition between the two tables).

The simplest rule for breaking XML information across multiple tables is to create a new table for every element that can occur multiply (has maxOccurs > 1) within its parent element. Elements that occur exactly once within a parent element are placed in the same table as the parent (and any reasonable shredding algorithm should be able to do this through multiple levels of singular elements). But what about optional elements? These could be placed in their own table, or they could be placed in the same table with the parent, using null when the element is not present. Inlining optional elements avoids an extra join at runtime, but can result in larger database sizes, particularly if the optional element is large and does not occur often in the data. Neither choice is optimal in all circumstances.

Consolidation is the process of re-using the same table for data that occurs in multiple locations in the database, most often because a common element type (e.g., something like an address) is re-used multiple times. For consolidation to be possible, a consistent set of fields must be used to join between the consolidated table and various parent tables (either the same fields are used in each case, or at least the entire set of fields is populated consistently). This is an easy condition to satisfy if node-ids are used as join conditions, but can be more difficult otherwise. Consolidation reduces the total number of tables required for a shredded representation.

Support of Full XML

The most important factor that affects shredding applications is that input XML sources can use arbitrary features of XML (and DTDs or XML Schema), including features that do not map well to relational storage. Examples of these features include poor mapping of datatypes (e.g., strings with unbounded length), variability of representation (e.g., xs:choice), ordered polymorphic sequences (particularly sequences containing repeating subsequences), mixed content, and arbitrary extensibility (e.g., xs:any). DTDs suffer from many of the same problems. XML with variable or no schema is even harder to handle. For variable schemas, if the schemas are known in advance, it may be possible to create a shredded representation that encompasses the union of all the possible structures. When the schema is not known in advance, or doesn't exist at all, it may be possible to guess a “shape” of the XML by looking at sample documents, but there is no guarantee that future documents will share that shape. In general, the more amorphous or varying the structure of the input XML, the more likely it is that a LOB representation will be more appropriate than a composed representation.

Schema-Independent Representation

One possibility for handling the vagaries of full XML is to use a relational representation that is totally independent of the schema of the XML data. An example of such a representation is an edge table, in which a single table contains information about the relationship between parent and child elements (using node identifiers), and another column contains simple element content. Listing 6.14 provides an example of an XML fragment and an edge-table representation of it.

Listing 6.14 An Edge Table for an XML Fragment

<Department id="A12x" name="Physics">
  <Employee id="555-23-4567">
    <name>Mary Phillips</name>
  <Employee id="544-12-3456">

edge table
parentid  childid  name         value
null      1        Department   null
1         2        @id          A12x
1         3        @name        Physics
1         4        Employee     null
4         5        @id          555-23-4567
4         6        name         Mary Phillips
4         7        office       21
1         8        Employee     null
8         9        @id          544-12-3456

While edge tables or similar structures offer a certain attractive simplicity and can represent almost any XML input, they have not been widely used in layered processing models, since they do not take effective advantage of relational database capabilities: Every single navigation requires an independent join onto the same table or tables, and indexing is not very effective. However, the edge table can be a useful model for a native XML implementation within a relational database, in which the database can add additional crucial indexing information to the table (see Chapter 7 for a discussion).

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020