Subtyping Algorithm with Pruning Optimization
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    Statically typed XML processing languages show new ways of processing XML data. However, current languages are not efficient enough. This paper studies the decision problem of subtyping relation which is an important issue of the languages, and optimizes XDuce’s subtyping algorithm with a pruning strategy. Experimental data show the efficiency of the algorithm increased 20% averagely. This optimization strategy can be applied to other languages which use similar subtyping algorithm.

    Reference
    Related
    Cited by
Get Citation

戴晓君,陈海明.采用了剪枝优化的子类型关系判定算法.软件学报,2010,21(7):1481-1490

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 24,2008
  • Revised:November 26,2009
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063