Eager xpath evaluation over XML streams

Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda

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

Abstract

We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|∈+∈n 2)|D|) time and O(|Q|height(D) ∈+∈n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|∈+∈n·height(D))|D|) time using the same space.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings
Pages245-250
Number of pages6
DOIs
Publication statusPublished - Oct 22 2012
Event19th International Symposium on String Processing and Information Retrieval, SPIRE 2012 - Cartagena de Indias, Colombia
Duration: Oct 21 2012Oct 25 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7608 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Symposium on String Processing and Information Retrieval, SPIRE 2012
CountryColombia
CityCartagena de Indias
Period10/21/1210/25/12

Fingerprint

XPath
XML
Evaluation
D-space
Evaluate
Vertex of a graph
Streaming
Instant
Fragment
Query

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hagio, K., Ohgami, T., Bannai, H., & Takeda, M. (2012). Eager xpath evaluation over XML streams. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings (pp. 245-250). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS). https://doi.org/10.1007/978-3-642-34109-0-26

Eager xpath evaluation over XML streams. / Hagio, Kazuhito; Ohgami, Takashi; Bannai, Hideo; Takeda, Masayuki.

String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. p. 245-250 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7608 LNCS).

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

Hagio, K, Ohgami, T, Bannai, H & Takeda, M 2012, Eager xpath evaluation over XML streams. in String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7608 LNCS, pp. 245-250, 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, Cartagena de Indias, Colombia, 10/21/12. https://doi.org/10.1007/978-3-642-34109-0-26
Hagio K, Ohgami T, Bannai H, Takeda M. Eager xpath evaluation over XML streams. In String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. p. 245-250. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34109-0-26
Hagio, Kazuhito ; Ohgami, Takashi ; Bannai, Hideo ; Takeda, Masayuki. / Eager xpath evaluation over XML streams. String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. 2012. pp. 245-250 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{50507aa0ab374471ac4b2c863a1c1014,
title = "Eager xpath evaluation over XML streams",
abstract = "We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|∈+∈n 2)|D|) time and O(|Q|height(D) ∈+∈n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|∈+∈n·height(D))|D|) time using the same space.",
author = "Kazuhito Hagio and Takashi Ohgami and Hideo Bannai and Masayuki Takeda",
year = "2012",
month = "10",
day = "22",
doi = "10.1007/978-3-642-34109-0-26",
language = "English",
isbn = "9783642341083",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "245--250",
booktitle = "String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings",

}

TY - GEN

T1 - Eager xpath evaluation over XML streams

AU - Hagio, Kazuhito

AU - Ohgami, Takashi

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2012/10/22

Y1 - 2012/10/22

N2 - We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|∈+∈n 2)|D|) time and O(|Q|height(D) ∈+∈n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|∈+∈n·height(D))|D|) time using the same space.

AB - We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|∈+∈n 2)|D|) time and O(|Q|height(D) ∈+∈n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|∈+∈n·height(D))|D|) time using the same space.

UR - http://www.scopus.com/inward/record.url?scp=84867549164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867549164&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-34109-0-26

DO - 10.1007/978-3-642-34109-0-26

M3 - Conference contribution

AN - SCOPUS:84867549164

SN - 9783642341083

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 245

EP - 250

BT - String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings

ER -