XML 정규 경로식을 위한 유연 질의 처리 시스템

초록

The eXtensible Markup Language(XML) is emerging as standard format of data representation and exchange on the Internet. A number of document are written in XML. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Previous proposed systems use same structure information and operation to process query. Therefore, they are only adaptable for specific query, not various query. In this paper, we propose flexible query processing system. To process query efficiently, we analyze regular path expression queries, then we use θ-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent's region start value to check parent-descendent relationship. Thus, we process various XML regular path expression query efficiently. From the experimental results, we could show that proposed XML query processing system is more efficient than previous systems in query processing.