计算机科学 ›› 2010, Vol. 37 ›› Issue (3): 182-187204.

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

路径分区编码优化小枝查询

徐小双,冯玉才,王锋,周英飚,张俊   

  1. (黄冈师范学院教育科学与技术学院 黄冈438000);(华中科技大学计算机学院多媒体数据库研究所 武汉430073);(达梦数据库有限公司预研部 武汉430073)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家信息产业部科技攻关课题(No. 2005BA112A02-DB-DM)和湖北省发改委基金(No.[2007]1334)资助。

Path-partitioned Encoding Optimizes Twig Queries

XU Xiao-shuang,FENG Yu-cai,WANG Feng,ZHOU Ying-biao,ZHANG Jun   

  • Online:2018-12-01 Published:2018-12-01

摘要: 有效地存储查询XML文档已经成为当今数据库领域的研究热点。从XML文档的路径统计出发,提出了路径分区存储编码方案,并依此消除了小枝查询的后裔边和通配符。针对这类不含“//’’和“、”的小枝查询,利用路径分 区编码的特性,给出了基于结构约束节点的Twig查询算法,极大地减少了结构连接次数。实验表明,该算法能有效滤除无关元素,提高小枝查询效率。

关键词: XM工,小枝查询,结构连接,路径统计

Abstract: Effectively storing and querying XMI. documents becomes a hot research topic on current database domain. In the light of path summary, path-partitioned encoding scheme was proposed to store an XMI_ document, and useful for eliminating descendant axes and wildcards in twig queries. For twig queries without“//,,or“、”,a new query algorithm was developed based on structurcconstraincd nodes, so structural joins extremely decreases. The results of experimenu indicate the algorithm can significantly filter useless elements and improve the performance for twig queries.

Key words: XML, Twig query, Structural j oin, Path summary

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!