Temporal slicing in the evaluation of XML queries

Research output: Chapter in Book/Report/Conference proceedingConference contribution

49 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 29th International Conference on Very Large Data Bases, VLDB 2003
PublisherMorgan Kaufmann
Pages632-643
Number of pages12
ISBN (Electronic)0127224424, 9780127224428
StatePublished - 2003
Event29th International Conference on Very Large Data Bases, VLDB 2003 - Berlin, Germany
Duration: Sep 9 2003Sep 12 2003

Other

Other29th International Conference on Very Large Data Bases, VLDB 2003
CountryGermany
CityBerlin
Period9/9/039/12/03

Fingerprint

XML
Query languages
Semantics
Query
Evaluation
Engines

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Information Systems and Management
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Gao, D., & Snodgrass, R. T. (2003). Temporal slicing in the evaluation of XML queries. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003 (pp. 632-643). Morgan Kaufmann.

Temporal slicing in the evaluation of XML queries. / Gao, Dengfeng; Snodgrass, Richard Thomas.

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. p. 632-643.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gao, D & Snodgrass, RT 2003, Temporal slicing in the evaluation of XML queries. in Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, pp. 632-643, 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, 9/9/03.
Gao D, Snodgrass RT. Temporal slicing in the evaluation of XML queries. In Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann. 2003. p. 632-643
Gao, Dengfeng ; Snodgrass, Richard Thomas. / Temporal slicing in the evaluation of XML queries. Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003. Morgan Kaufmann, 2003. pp. 632-643
@inproceedings{622a9079d0cc424a929f6fd97038707e,
title = "Temporal slicing in the evaluation of XML queries",
abstract = "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.",
author = "Dengfeng Gao and Snodgrass, {Richard Thomas}",
year = "2003",
language = "English (US)",
pages = "632--643",
booktitle = "Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003",
publisher = "Morgan Kaufmann",

}

TY - GEN

T1 - Temporal slicing in the evaluation of XML queries

AU - Gao, Dengfeng

AU - Snodgrass, Richard Thomas

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

M3 - Conference contribution

SP - 632

EP - 643

BT - Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

PB - Morgan Kaufmann

ER -