XMask: An Enabled XML Management System

  • Moad Maghaydah
  • Mehmet A. Orgun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4243)


Storing XML documents in relational database systems is still the most affordable and available storage solution. Meanwhile more work is still needed to provide efficient support for dynamic XML data stored in RDBMS. We present an abstract design for an Enabled XML Management System, and also propose a new labeling approach for nodes in XML documents, which we call XMask. XMask is a Dewey based labeling technique where each element is identified by a label consisting of two values (1) node Id (2) and node Mask. XMask can efficiently maintain the document structure and order with a short-length label that can fit in a 32-bit integer. We report the results of experimental evaluation using XML data between our approach and two other approaches, namely Edge and XRel, which use integer values for labeling as well. We show that our approach outperforms the other two approaches for complex queries.


Complex Query Document Order Path Table Node Mask Subnet Mask 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bosak, J.: Shakespeare 2.00 (1999),
  2. 2.
    Cohen, E., Kaplan, H., Milo, T.: Labeling Dynamic XML Trees. In: Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Madison, Wisconsin, USA (2002)Google Scholar
  3. 3.
    Florescu, D., Kossmann, D.: Storing and Querying XML data using an RDBMS. IEEE Data Engineering Bulletin 22(3) (1999)Google Scholar
  4. 4.
    Jagadish, H., et al.: TIMBER: A native XML database. In: VLDB 2002, vol. 11, pp. 274–291 (2002)Google Scholar
  5. 5.
    Jiang, H., et al.: Path Materialization Revesited: An Efficient Storage Model For XML Data. In: Australasian Database Conference (2002)Google Scholar
  6. 6.
    Kaplan, H., Milo, T., Shabo, R.: A Comparison of Labeling Schemes for Ancestor Queries. In: The Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA (2002)Google Scholar
  7. 7.
    Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: The 27th VLDB Conference, Roma, Italy (2001)Google Scholar
  8. 8.
    Maghaydah, M., Orgun, M.: Labeling XML Nodes in RDBMS. In: APWeb Workshops 2006, pp. 122–126 (2006)Google Scholar
  9. 9.
    McHugh, J., et al.: Lore: A Database Management System For SemiStructured Data. SIGMOD 26(3), 54–66 (1997)CrossRefGoogle Scholar
  10. 10.
    Nambiar, U., et al.: Current Approaches to XML Management. Internet Computing 6(4), 43–51 (2002)CrossRefGoogle Scholar
  11. 11.
    O’Neil, P., et al.: ORDPATHs: Insert-Friendly XML Node Labels. In: ACM SIGMOD, Paris, France (2004)Google Scholar
  12. 12.
    Shanmugasundaram, J., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: ACM SIGMOD, pp. 204–215 (2002)Google Scholar
  13. 13.
    Shanmugasundaram, J., et al.: Relational Databases for Querying XML Documents: Limitations and Opportunities. In: The 25th VLDB Conference, pp. 302–314 (1999)Google Scholar
  14. 14.
    XQuery 1.0 and XPath 2.0 Data Model,
  15. 15.
    YoshiKawa, A.: XRel: A path-based approach to Storage and Retrieval of XML Documents using Relational Database. ACM Transactions on Internet Technology 1(1) (2001)Google Scholar
  16. 16.
    Zhang, C., et al.: On Supporting Queries in Relational Database Management Systems. In: SIGMOD 2001, Santa Barbara, California USA (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Moad Maghaydah
    • 1
  • Mehmet A. Orgun
    • 1
  1. 1.Department of ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations