Scalable XSLT Evaluation
Zhimao Guo, Min Li, Xiaoling Wang, Aoying Zhou
Abstract
XSLT is an increasingly popular language for processing XML data. It is widely supported by application platform software. However, little optimization effort has been made inside the current XSLT processing engines. Evaluating a very simple XSLT program on a large XML document with a simple schema may result in extensive usage of memory. In this paper, we present a novel notion of Streaming Processing Model (SPM) to evaluate a subset of XSLT programs on XML documents, especially large ones. With SPM, an XSLT processor can transform an XML source document to other formats without extra memory buffers required. Therefore, our approach can not only tackle large source documents, but also produce large results. We demonstrate with a performance study the advantages of the SPM approach. Experimental results clearly confirm that SPM improves XSLT evaluation typically 2 to 10 times better than the existing approaches. Moreover, the SPM approach also features high scalability.
Create a lesson
Related papers
Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Oktie Hassanzadeh, Dharmashankar Subramanian
ProvQML: Efficient Provenance Capture for Machine Learning as Recursive Aggregate SQL [Extended Version]
Nkechi J. Akinwale, Seokki Lee
Benchmarking Content-Defined Chunking Algorithms for Data Deduplication
Marcel Gregoriadis, Leonhard Balduf, Björn Scheuermann et al.
Time-Varying Favorite-Longshot Bias in Polymarket Weather Markets
Shouchen Qiu, Huaijun Qiu
MatQuery: Execution-Grounded Natural-Language Querying over Heterogeneous Materials Databases
Chen Jason Zhang, Qi Chen
CALQA: Conformal Screening of Forecast-Ensemble Configurations from One Mergeable State
Xiufeng Liu, Ruyu Liu, Yusen Liu et al.