TY - GEN
T1 - Temporal slicing in the evaluation of XML queries
AU - Gao, Dengfeng
AU - Snodgrass, Richard T.
N1 - Funding Information:
We thank Bengu Li and Curtis Dyreson for help in the initial stages and Merrie Brucks and Shankar Ganesan of the University of Arizona Department of Marketing for help with the CRM case study. This research was supported in part by NSF grants IIS-0100436 and EIA-0080123 and grants from the Boeing Corporation and Microsoft.
PY - 2003
Y1 - 2003
N2 - As with relational data, XML data changes over time with the creation, modification, and deletion of XML documents. Expressing queries on timevarying (relational or XML) data is more difficult than writing queries on nontemporal data. In this paper, we present a temporal XML query language, XQuery, in which we add valid time support to XQuery by minimally extending the syntax and semantics of XQuery. We adopt a stratum approach which maps a XQuery query to a conventional XQuery. The paper focuses on how to perform this mapping, in particular, on mapping sequenced queries, which are by far the most challenging. The critical issue of supporting sequenced queries (in any query language) is time-slicing the input data while retaining period timestamping. Timestamps are distributed throughout an XML document, rather than uniformly in tuples, complicating the temporal slicing while also providing opportunities for optimization. We propose four optimizations of our initial maximally-fragmented time-slicing approach: selected node slicing, copy-based perexpression slicing, in-place per-expression slicing, and idiomatic slicing, each of which reduces the number of constant periods over which the query is evaluated. While performance tradeoffs clearly depend on the underlying XQuery engine, we argue that there are queries that favor each of the five approaches.
AB - As with relational data, XML data changes over time with the creation, modification, and deletion of XML documents. Expressing queries on timevarying (relational or XML) data is more difficult than writing queries on nontemporal data. In this paper, we present a temporal XML query language, XQuery, in which we add valid time support to XQuery by minimally extending the syntax and semantics of XQuery. We adopt a stratum approach which maps a XQuery query to a conventional XQuery. The paper focuses on how to perform this mapping, in particular, on mapping sequenced queries, which are by far the most challenging. The critical issue of supporting sequenced queries (in any query language) is time-slicing the input data while retaining period timestamping. Timestamps are distributed throughout an XML document, rather than uniformly in tuples, complicating the temporal slicing while also providing opportunities for optimization. We propose four optimizations of our initial maximally-fragmented time-slicing approach: selected node slicing, copy-based perexpression slicing, in-place per-expression slicing, and idiomatic slicing, each of which reduces the number of constant periods over which the query is evaluated. While performance tradeoffs clearly depend on the underlying XQuery engine, we argue that there are queries that favor each of the five approaches.
UR - http://www.scopus.com/inward/record.url?scp=84860502150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860502150&partnerID=8YFLogxK
U2 - 10.1016/b978-012722442-8/50062-8
DO - 10.1016/b978-012722442-8/50062-8
M3 - Conference contribution
AN - SCOPUS:84860502150
T3 - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
SP - 632
EP - 643
BT - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
A2 - Freytag, Johann Christoph
A2 - Lockemann, Peter C.
A2 - Abiteboul, Serge
A2 - Carey, Michael J.
A2 - Selinger, Patricia G.
A2 - Heuer, Andreas
PB - Morgan Kaufmann
T2 - 29th International Conference on Very Large Data Bases, VLDB 2003
Y2 - 9 September 2003 through 12 September 2003
ER -