Improved Algorithm for Minimizing Pattern Tree Queries of XML
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    At present, Minimization of Pattern Tree Queries, becomes the key factor that affects query processing performance of XML data. An improved algorithm is proposed with structural index of XML, based on analyzing the existing methods of Minimization of Pattern Tree Queries. It's effective to solve that grammar level optimization can't effectively remove redundant nodes of the defect in the common sense, so as to improve the efficiency of the inquiry. Experimental results show the effectiveness and accuracy of the proposed minimization algorithm.

    Reference
    Related
    Cited by
Get Citation

魏东平,吴玉雁,朱新向.一种改进XML模式树查询最小化算法.计算机系统应用,2012,21(4):234-237

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 20,2011
  • Revised:August 30,2011
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063