IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v168y2009i1p133-15010.1007-s10479-008-0361-y.html
   My bibliography  Save this article

Towards optimal workload-aware XML to relational schema mapping

Author

Listed:
  • Xiaoling Wang
  • Jinfeng Luan
  • Guimei Liu
  • Aoying Zhou

Abstract

Storing XML documents in relational databases has drawn much attention in recent years because it can leverage existing investments in relational database technologies. Different algorithms have been proposed to map XML DTD/Schema to relational schema in order to store XML data in relational databases. However, most work defines mapping rules based on heuristics without considering application characteristics, hence fails to produce efficient relational schema for various applications. In this paper, we propose a workload-aware approach to generate relational schema from XML data and user specified workload. Our approach adopts the genetic algorithm to find optimal mappings. An elegant encoding method and related operations are proposed to manipulate mappings using bit strings. Various techniques for optimization can be applied to the XML to relational mapping problem based on this representation. We implemented the proposed algorithm and our experiment results showed that our algorithm was more robust and produced better mappings than existing work. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • Xiaoling Wang & Jinfeng Luan & Guimei Liu & Aoying Zhou, 2009. "Towards optimal workload-aware XML to relational schema mapping," Annals of Operations Research, Springer, vol. 168(1), pages 133-150, April.
    • Handle: RePEc:spr:annopr:v:168:y:2009:i:1:p:133-150:10.1007/s10479-008-0361-y
    DOI: 10.1007/s10479-008-0361-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0361-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0361-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:168:y:2009:i:1:p:133-150:10.1007/s10479-008-0361-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.