The Unicode standard version 3.0
The Unicode standard version 3.0
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
Proceedings of the 2002 ACM symposium on Document engineering
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Efficient keyword search over virtual XML views
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Information Systems
Efficient keyword search over virtual XML views
The VLDB Journal — The International Journal on Very Large Data Bases
How to edit gigabyte XML files on a mobile phone with XAS, RefTrees, and RAXS
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Optimized reprocessing of documents using stored processor state
Proceedings of the 10th ACM symposium on Document engineering
Lazy execution of model-to-model transformations
Proceedings of the 14th international conference on Model driven engineering languages and systems
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
A research roadmap towards achieving scalability in model driven engineering
Proceedings of the Workshop on Scalability in Model Driven Engineering
JetXSLT: a resource-conscious XSLT processor
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
| Hi-index | 0.00 |
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tree are computed only upon initial access. As these computations have limited fan-in, sparse output coverage propagates backwards through the pipeline.In comparative measurements with traditional eager implementations, our approach is on par for complete coverage and excels as coverage becomes sparser. In contrast to eager evaluation, lazy evaluation also admits infinite intermediate results, thus extending the design space for transformation sequences.To demonstrate that lazy evaluation preserves the semantics of XSLT, we reduce XSLT to the lambda calculus via a functional language. While this is possible for all languages, most imperative languages cannot profit from the confluence of lambda as only one reduction applies at a time.