XML is fast emerging as the dominant standard for representing data in the World Wide Web. XML is an example of a semi-structured data and XML document can be represented as a graph structure where each element and attribute in document corresponds to vertex.
To efficiently manage the accumulated huge XML data, we need an XML storage system to store and query the XML data. There are several approaches to store XML, native XML storage system approach which implements the semi-structured technique, relational database approach, etc.
In this paper, we use a relational database to store the XML data and store each edge in a XML graph. The query performance of previous work which implemented the edge approach was not so good because the number of join operation is considerably numerous.
We propose a novel numbering scheme and a method of encoding redundant parent path information to reduce the number of join operation resulting in better query performance, especially for the regular path expression query with wild card operator.
