Different models have been proposed recently
for representing temporal data, tracking historical
information, and recovering the state
of the document as of any given time, in XML
documents. We address the problem of indexing
temporal XML documents. In particular
we show that by indexing continuous paths,
i.e. paths that are valid continuously during a
certain interval in a temporal XML graph, we
can dramatically increase query performance.
We describe in detail the indexing scheme,
denoted TempIndex, and compare its performance
against both a system based on a nontemporal
path index, and one based on DOM.
%0 Conference Paper
%1 mendelzon04
%A Mendelzon, Albert
%A Rizzolo, Flavio
%A Vaisman, Alejandro
%B Conference on Very Large DataBases
%C Toronto
%D 2004
%E Nascimento, Mario A.
%E Özsu, Tamer M.
%E Kossmann, Donald
%E Miller, Renée J.
%E Blakeley, José A.
%E Schiefer, Bernie
%K evolution xml database
%T Indexing Temporal XML Documents
%U http://www.cs.utoronto.ca/~flavio/vldb2004.pdf
%X Different models have been proposed recently
for representing temporal data, tracking historical
information, and recovering the state
of the document as of any given time, in XML
documents. We address the problem of indexing
temporal XML documents. In particular
we show that by indexing continuous paths,
i.e. paths that are valid continuously during a
certain interval in a temporal XML graph, we
can dramatically increase query performance.
We describe in detail the indexing scheme,
denoted TempIndex, and compare its performance
against both a system based on a nontemporal
path index, and one based on DOM.
@inproceedings{mendelzon04,
abstract = {Different models have been proposed recently
for representing temporal data, tracking historical
information, and recovering the state
of the document as of any given time, in XML
documents. We address the problem of indexing
temporal XML documents. In particular
we show that by indexing continuous paths,
i.e. paths that are valid continuously during a
certain interval in a temporal XML graph, we
can dramatically increase query performance.
We describe in detail the indexing scheme,
denoted TempIndex, and compare its performance
against both a system based on a nontemporal
path index, and one based on DOM.},
added-at = {2006-09-20T22:40:43.000+0200},
address = {Toronto},
author = {Mendelzon, Albert and Rizzolo, Flavio and Vaisman, Alejandro},
biburl = {https://www.bibsonomy.org/bibtex/2828c17f5fd5937248852c5d1d5ef81c4/neilernst},
booktitle = {Conference on Very Large DataBases},
editor = {Nascimento, Mario A. and Özsu, Tamer M. and Kossmann, Donald and Miller, Renée J. and Blakeley, José A. and Schiefer, Bernie},
interhash = {a0d166a53c5beecc9f53ed20d402de39},
intrahash = {828c17f5fd5937248852c5d1d5ef81c4},
keywords = {evolution xml database},
month = {September},
timestamp = {2006-09-20T22:40:43.000+0200},
title = {Indexing Temporal XML Documents},
url = {http://www.cs.utoronto.ca/~flavio/vldb2004.pdf},
year = 2004
}