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

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

DOI:
10.1145/383034.383038
复制
发表时间:
2001
期刊:
ACM Trans. Internet Techn.
影响因子:
--
通讯作者:
Masatoshi Yoshikawa;Toshiyuki Amagasa;Takeyuki Shimura;Shunsuke Uemura
Masatoshi Yoshikawa;Toshiyuki Amagasa;Takeyuki Shimura;Shunsuke Uemura
中科院分区:
其他
文献类型:
--
作者:
Masatoshi Yoshikawa;Toshiyuki Amagasa;Takeyuki Shimura;Shunsuke Uemura

文献摘要

被引文献

相似文献

本文描述XRel,一种使用关系数据库存储和检索XML文档的新方法。在这种方法中,XML文档根据其树结构分解为节点,并根据节点类型存储在关系表中,并具有从根到每个节点的路径信息。XRel使我们能够使用固定的关系模式存储XML文档,而不需要任何关于dtd的信息,还可以利用数据库管理系统支持的b1树和r树等索引。因此,XRel不需要任何关系数据库的扩展来存储XML文档。为了处理XML查询,我们提出了一种将XPath表达式的核心子集转换为SQL查询的算法。最后,我们通过几个使用实际XML文档的实验来证明这种方法的有效性。
This article describes XRel, a novel approach for storage and retrieval of XML documents using relational databases. In this approach, an XML document is decomposed into nodes on the basis of its tree structure and stored in relational tables according to the node type, with path information from the root to each node. XRel enables us to store XML documents using a fixed relational schema without any information about DTDs and also to utilize indices such as the B 1 -tree and the R-tree supported by database management systems. Thus, XRel does not need any extension of relational databases for storing XML documents. For processing XML queries, we present an algorithm for translating a core subset of XPath expressions into SQL queries. Finally, we demonstrate the effectiveness of this approach through several experiments using actual XML documents.