In this work, we propose a storage model and rules of the QUERY RANGE for high-speed retrieval of XML document. With the appearance of XML on the Internet, storing and querying XML data becomes more and more important. There are two streams of the research against storing XML data. One is to manage XML data to be stored in a relational database. The other is to build a specialized data manager that contains XML data repository at its core. In this work, we adopt the former, a relational database to store XML data because when managing XML data, we can use lots of the advantages provided with a relational database such as query optimization, query execution, scalability, concurrency control, recovery and so on. We propose adequate schemas for mapping XML data to relational databases. In the existing works, in spite of the fact that XPath has a power of expression, when querying XML data in database management systems, most research have had a focus on regular path expression. Such approaches hardly provide an adequate support for the XPath expression queries. Therefore, we also propose rules of the QUERY RANGE for the evaluation of XPath queries on XML data. It helps us to overcome the limitation of the regular path expression and to utilize all of the XPath expressions. Experimental results demonstrate that the proposed data structure outperforms the other systems in existing work on majority of queries. The performance of retrieval speed is higher than them up to an order of magnitude times on some queries.
|ジャーナル||WSEAS Transactions on Computers|
|出版ステータス||Published - 2006 7 1|
ASJC Scopus subject areas
- Computer Science(all)