An XPATH query processor for a decomposition storage scheme

Authors:
Young-Ki Ko;Eui-Kyeong Hong;Myung Kim
Affiliations:
Department of Computer Science, University of Seoul, AITrc, Korea;Department of Computer Science, University of Seoul, AITrc, Korea;Department of Computer Science & Engineering, Ewha Womans University, Korea
Venue:
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Year:
2003

Citing 6
Cited 0

XRel: a path-based approach to storage and retrieval of XML documents using relational databases

ACM Transactions on Internet Technology (TOIT)
The design and performance evaluation of alternative XML storage strategies

ACM SIGMOD Record
Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Relational Databases for Querying XML Documents: Limitations and Opportunities

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Relational Storage and Retrieval of XML Documents

Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Using XML in Relational Database Applications

ICDE '99 Proceedings of the 15th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML is a markup language that is widely accepted as a standard way of information sharing and exchange, especially on the Web. One of the recent database research issues is to devise ways of storing XML documents as well as retrieving them efficiently. In this paper, we present an XPath query processor that can be used for retrieving XML documents that are stored in a relational database by a decomposition storage scheme. Our XPath query processor, when given an XPath query, translates it to appropriate SQL statements. The SQL query results are then transformed to a DOM tree that is a way of representing part of an XML document. The proposed query processor is optimized for element range queries by using DFS numbers along with path expressions. We evaluated the performance of the proposed query processor using XML documents of various sizes and common types of XML queries.