Noralhuda Alabid MSc Dissertation 2014/15

Displaying The XML Labelling Schemes By Using Graph Tree

Supervised by S.North

Abstract

Since the XML documents are widely used for web interchanging, so finding a query mechanism to extract a specific data becomes essential. Much research is in

a competition to present ideal techniques for identifying the XML documents in efficient labels. The main problem that could face this demand is the ability to find labels quickly with short string. This project aims to display these schemes in a graph tree in a way that enable audiences to recognize how these schemes are implemented. Using graphs to display contents or information have great benefit to explain them. The contents of the XML documents are tend to be in hierarchy, as a result displaying them as tree graphs will simulate their reality.

Most of these schemes are depended on involving the label of parent to label children. Therefore, to parse the XML documents, DOM parser is used to keep the tree structure of the XML documents to enable calling parents and use their information. Three labelling schemes are used: the Dewey labelling scheme, the Prime Number scheme and LSDX scheme. However, this project has the flexibility to display more schemes. For drawing graphs, layout algorithm is used for that. This algorithm depends on determining the space of each node and the left border of this space. By generating this graph and displaying labels in its nodes, users can print this graph by using the current printing system and obtain a paper copy of XMLlabelling tree.