A Low-Memory Streaming Algorithm for XSLT Processing Implemented in Xord Framework

被引:0
|
作者
Dvorakova, Jana [1 ]
Zavoral, Filip [1 ]
机构
[1] Charles Univ Prague, Fac Math & Phys, Dept Software Engn, Prague, Czech Republic
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present an implementation of the Xord framework for streaming processing of XSLT transformations based on. Net technologies. Within the framework, we implement an efficient streaming algorithm capable to process a significant subset of top-down XSLT transformations. We exactly characterize this class of transformations. The algorithm uses a stack of the size proportional to the depth of the input XML document. Such memory usage is highly efficient in practice, since real-world XML documents are shallow. The evaluation of the algorithm supports our expectations and shows that a transformation of large but shallow XML documents is processed using a constant size of memory.
引用
收藏
页码:31 / 36
页数:6
相关论文
共 23 条
  • [1] Xord: An Implementation Framework for Efficient XSLT Processing
    Dvorakova, Jana
    Zavoral, Filip
    INTELLIGENT DISTRIBUTED COMPUTING, SYSTEMS AND APPLICATIONS, 2008, 162 : 95 - 104
  • [2] Streaming data reduction using low-memory factored representations
    Littau, David
    Boley, Daniel
    INFORMATION SCIENCES, 2006, 176 (14) : 2016 - 2041
  • [3] A Low-Memory Algorithm for Point Counting on Picard Curves
    Annegret Weng
    Designs, Codes and Cryptography, 2006, 38 : 383 - 393
  • [4] A low-memory algorithm for point counting on Picard curves
    Weng, A
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 38 (03) : 383 - 393
  • [5] Low-Memory Hybrid Discontinuous Galerkin Time Domain Algorithm
    Ban, Zhen Guo
    Zhu, Shi Chen
    Shi, Yan
    Li, Long
    2020 IEEE MTT-S INTERNATIONAL CONFERENCE ON NUMERICAL ELECTROMAGNETIC AND MULTIPHYSICS MODELING AND OPTIMIZATION (NEMO 2020), 2020,
  • [6] A low-memory algorithm for finding short product representations in finite groups
    Bisson, Gaetan
    Sutherland, Andrew V.
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 63 (01) : 1 - 13
  • [7] A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm
    Gaudry, P
    Schost, T
    ALGORITHMIC NUMBER THEORY, PRCEEDINGS, 2004, 3076 : 208 - 222
  • [8] A low-memory algorithm for finding short product representations in finite groups
    Gaetan Bisson
    Andrew V. Sutherland
    Designs, Codes and Cryptography, 2012, 63 : 1 - 13
  • [9] Solving the quadratic trust-region subproblem in a low-memory BFGS framework
    Apostolopoulou, M. S.
    Sotiropoulos, D. G.
    Pintelas, P.
    OPTIMIZATION METHODS & SOFTWARE, 2008, 23 (05): : 651 - 674
  • [10] Low-complexity, Low-memory EMS algorithm for non-binary LDPC codes
    Voicila, Adrian
    Declercq, David
    Verdier, Francois
    Fossotier, Marc
    Urard, Pascal
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 671 - +