CAJ | 학술논문

在XML数据查询中,结构连接操作占用了大量时间.针对这个问题,提出一种高效查询的编码方案-LSEQ编码.它将节点路径信息进行分解,避免记录路径的重复信息,减小了编码长度;同时支持节点祖先后代关系,父子关系和兄弟关系的表示.LSEQ编码通过记录非叶节点的路径,在节点查询中避免了结构连接操作,提高了查询效率.实验表明LSEQ编码提高了空间利用率,在查询速度上具有出良好的性能.
재XML수거사순중,결구련접조작점용료대량시간.침대저개문제,제출일충고효사순적편마방안-LSEQ편마.타장절점로경신식진행분해,피면기록로경적중복신식,감소료편마장도;동시지지절점조선후대관계,부자관계화형제관계적표시.LSEQ편마통과기록비협절점적로경,재절점사순중피면료결구련접조작,제고료사순효솔.실험표명LSEQ편마제고료공간이용솔,재사순속도상구유출량호적성능.
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.