关键词: XML编码, 数据存储, 路径表达式, 数据查询, 查询优化

Abstract: As the core operation in XML query processing, structural joining consumes a great deal of time. The authors proposed a new approach called labeling scheme for efficient query processing (LSEQ). By decomposing path information, LSEQ avoided recording repeated information and reduced labeling length. Moreover, LSEQ supported the representation of ancestor-descendant relationship, parent-children relationship and sibling relationship between any two nodes. Through storing the path of internal nodes, LSEQ enhanced querying efficiency and avoided structure-joining. The experimental results show that, the LSEQ has advantages in compacting translated SQL and lessening relational database space.

Key words: XML coding, data storage, path expression, data query, query optimization