An efficient XML index technique with relative position coordinate

Authors:
Tackgon Kim;Wooseang Kim
Affiliations:
Dept. of Computer Science, Kwangwoon University, Seoul, Korea;Dept. of Computer Science, Kwangwoon University, Seoul, Korea
Venue:
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
Year:
2005

Citing 6
Cited 0

Updating XML

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
APEX: an adaptive path index for XML data

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
BitCube: A Three-Dimensional Bitmap Indexing for XML Documents

Journal of Intelligent Information Systems
An XML Indexing Structure with Relative Region Coordinate

Proceedings of the 17th International Conference on Data Engineering
Extensible Index Technique for Storing and Retrieving XML Documents

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient index technique with Relative Position Coordinate (RPC). It supports containment queries using SQL statements and data management operations. It does not cause serious performance degradations even if there are frequent update operations because it maintains relative relationship of XML tree. Overall, the performance could be improved by reduction of the number of times for traversing nodes.