计算机科学 ›› 2009, Vol. 36 ›› Issue (7): 145-149.doi: 10.11896/j.issn.1002-137X.2009.07.034

• 软件工程与数据库技术 • 上一篇    下一篇

基于分层结构的前缀编码方案研究

徐娟,李战怀,柯希林   

  1. (西北工业大学计算机学院 西安710072);(武汉大学资源与环境科学学院 武汉430079)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金项目(60720106001)资助。

Novel Prefix Encoding Scheme Based on Layered Structure

XU Juan,LI Zhan-lin,KE Xi-lin   

  • Online:2018-11-16 Published:2018-11-16

摘要: 在分析现有XML文档树前缀编码[1-4]存储空间特性的基础上,提出了一种新的基于分层结构的前缀编码方法。本编码方案具有较小的平均编码长度,且编码长度不随XML文档中结点深度的增加而加大;给出了查询轴关系计算的算法,由于编码长度较小,在查询轴关系计算时比较次数较少,因此可以提高计算效率,加速查询过程。充分的理论分析和试验结果证明,基于分层结构的前缀编码方案是一种加速查询和节约编码存储空间的较好的编码方案。

关键词: XML,前缀编码,分层结构,子树

Abstract: Most of the XML query strategies are based on some prefix schemes[1-4].By analyzing the current prefix schemes,we proposed a novel prefix encoding scheme with layered structure. The new prefix encoding scheme has relatively smaller mean coding length, and the code length is not increased with the depth increment of XML document. Another advantage this scheme brings out is, the query process was accelerated because component code comparisons for Xpath query axis computation become fewer with smaller code length. Extensive theoretic analysis and experimental resups show that this scheme is a better one which accelerates query process and saves the store space for the codes.

Key words: XML, Prefix encoding, Layered structure, Subtree

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!