Analysis of imperative XML programs
Burke, Michael G. ; Peshansky, Igor ; Raghavachari, Mukund and Reichenbach, Christoph LU
(2007)
11th International Symposium on Database Programming Languages, DBPL 2007
In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4797 LNCS.
p.216-230
- Abstract
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing imperative XML processing programs. In particular, we present a program analysis, based on a flow-sensitive type system, for detecting both redundant computations and redundant traversals in XML processing programs. The analysis handles declarative queries over XML data and imperative loops that traverse XML values explicitly in a uniform framework. We describe two optimizations that take advantage of our analysis: one merges queries that traverse the same set of XML nodes, and the other replaces an XPath expression by a previously computed result. We show the... (More)
The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing imperative XML processing programs. In particular, we present a program analysis, based on a flow-sensitive type system, for detecting both redundant computations and redundant traversals in XML processing programs. The analysis handles declarative queries over XML data and imperative loops that traverse XML values explicitly in a uniform framework. We describe two optimizations that take advantage of our analysis: one merges queries that traverse the same set of XML nodes, and the other replaces an XPath expression by a previously computed result. We show the effectiveness of our method by providing performance measurements on XMark benchmark queries and XLinq sample queries.
(Less)
- author
- Burke, Michael G.
; Peshansky, Igor
; Raghavachari, Mukund
and Reichenbach, Christoph
LU
- publishing date
- 2007-12-01
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Typing Rule, Type Environment, Loop Body, Redundant Computation, XPath Expression
- host publication
- Database Programming Languages : 11th International Symposium, DBPL 2007, Revised Selected Papers - 11th International Symposium, DBPL 2007, Revised Selected Papers
- series title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- volume
- 4797 LNCS
- pages
- 15 pages
- publisher
- Springer
- conference name
- 11th International Symposium on Database Programming Languages, DBPL 2007
- conference location
- Vienna, Austria
- conference dates
- 2007-09-23 - 2007-09-24
- external identifiers
-
- scopus:38449104916
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-540-75987-4
- 9783540759867
- DOI
- 10.1007/978-3-540-75987-4_15
- language
- English
- LU publication?
- no
- id
- 69ad522d-2e72-4331-887a-b582fee39f4d
- date added to LUP
- 2019-03-29 20:25:37
- date last changed
- 2024-01-01 00:32:11
@inbook{69ad522d-2e72-4331-887a-b582fee39f4d,
abstract = {{<p>The widespread adoption of XML has led to programming languages that support XML as a first class construct. In this paper, we present a method for analyzing and optimizing imperative XML processing programs. In particular, we present a program analysis, based on a flow-sensitive type system, for detecting both redundant computations and redundant traversals in XML processing programs. The analysis handles declarative queries over XML data and imperative loops that traverse XML values explicitly in a uniform framework. We describe two optimizations that take advantage of our analysis: one merges queries that traverse the same set of XML nodes, and the other replaces an XPath expression by a previously computed result. We show the effectiveness of our method by providing performance measurements on XMark benchmark queries and XLinq sample queries.</p>}},
author = {{Burke, Michael G. and Peshansky, Igor and Raghavachari, Mukund and Reichenbach, Christoph}},
booktitle = {{Database Programming Languages : 11th International Symposium, DBPL 2007, Revised Selected Papers}},
isbn = {{978-3-540-75987-4}},
issn = {{1611-3349}},
keywords = {{Typing Rule; Type Environment; Loop Body; Redundant Computation; XPath Expression}},
language = {{eng}},
month = {{12}},
pages = {{216--230}},
publisher = {{Springer}},
series = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
title = {{Analysis of imperative XML programs}},
url = {{http://dx.doi.org/10.1007/978-3-540-75987-4_15}},
doi = {{10.1007/978-3-540-75987-4_15}},
volume = {{4797 LNCS}},
year = {{2007}},
}