1 / 6

Stre a ming Processing of Large XML Data

Stre a ming Processing of Large XML Data. Jana Dvo řá kov á , Filip Zavoral processing of large XML data using XSLT with optimal memory complexity formal model / implementation framework analyzer, SSXT / BUXT transformer. SSXT - streaming transducer. Simple Streaming Xml Transducer

hogan
Download Presentation

Stre a ming Processing of Large XML Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Streaming Processing of Large XML Data Jana Dvořáková, Filip Zavoral processing of large XML data using XSLT with optimal memory complexity formal model / implementation framework analyzer, SSXT / BUXT transformer

  2. SSXT - streaming transducer • Simple Streaming Xml Transducer • no backward axis, no predicates, no variables • order-preserving • branch-disjoint •  stack / document depth • BUXT - Buffering Transducer

  3. Xord framework - Analyzer • Analyzer • XSLT & XSD: virtually applies templates to schema • all possible node sequences are processed • regexp • all possible node sequences selected by XPath expressions • possible reading orders of the elements • names • sequence of element names in the order they are called • represents the processing order of the elements

  4. SSXT Transformer • Polymorphic stack • two types of transformation states - DFA & CC • related to current document level • sequence of deterministic finite automata states • concurrent evaluation of XPath expressions • single DFA for each expression • start-tag → DFA transition • final state → template call • cycle configuration • template and template call being processed

  5. Evaluation & Comparison Memory consumption (MB) of SSXT algorithm and tree-based XSLT processors for input XML data of different size DBLP.xml ≈ 700 MB

  6. Future work • Future work • buffering transformer optimizations and evaluation • multipass streaming algorithms • overcoming some restrictions to XSLT constructs

More Related