A new path expression computing approach for XML data

Jianhua Lv; Guoren Wang; Jeffrey Xu Yu; Ge Yu; Hongjun Lu; Bing Sun

doi:10.1007/3-540-36556-7_3

A new path expression computing approach for XML data

Jianhua Lv^*
, Guoren Wang
, Jeffrey Xu Yu
, Ge Yu
, Hongjun Lu
, Bing Sun

^*Corresponding author for this work

Northeastern University China
Chinese University of Hong Kong
Hong Kong University of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Most query languages in XML database systems use Regular Path Expressions (RPE) to query or extract data from databases and some query processing and optimization techniques have been proposed for RPEs. Conceptually XML documents are collections of path instances. Each path instance should conform to an XML element tag sequence, called path schema. A RPE query can be written as an automaton that can represent a language, while path schemas can be seen as sentences. In this paper, a novel RPE computing approach, automaton match (AM), is proposed. AM queries the RPEs by matching the automatons with path schemas. The experimental results show AM is quite efficient for computing RPE queries.

Original language	English
Title of host publication	Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers
Publisher	Springer Verlag
Pages	35-46
Number of pages	12
ISBN (Print)	9783540007364
DOIs	https://doi.org/10.1007/3-540-36556-7_3
Publication status	Published - 2003
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2590
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-36556-7_3

Cite this

Lv, J., Wang, G., Yu, J. X., Yu, G., Lu, H., & Sun, B. (2003). A new path expression computing approach for XML data. In Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers (pp. 35-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2590). Springer Verlag. https://doi.org/10.1007/3-540-36556-7_3

Lv, Jianhua ; Wang, Guoren ; Yu, Jeffrey Xu et al. / A new path expression computing approach for XML data. Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers. Springer Verlag, 2003. pp. 35-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{affeeb41a13b423f9cfeec50d5bfec56,

title = "A new path expression computing approach for XML data",

abstract = "Most query languages in XML database systems use Regular Path Expressions (RPE) to query or extract data from databases and some query processing and optimization techniques have been proposed for RPEs. Conceptually XML documents are collections of path instances. Each path instance should conform to an XML element tag sequence, called path schema. A RPE query can be written as an automaton that can represent a language, while path schemas can be seen as sentences. In this paper, a novel RPE computing approach, automaton match (AM), is proposed. AM queries the RPEs by matching the automatons with path schemas. The experimental results show AM is quite efficient for computing RPE queries.",

author = "Jianhua Lv and Guoren Wang and Yu, \{Jeffrey Xu\} and Ge Yu and Hongjun Lu and Bing Sun",

year = "2003",

doi = "10.1007/3-540-36556-7\_3",

language = "English",

isbn = "9783540007364",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "35--46",

booktitle = "Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers",

address = "Germany",

}

Lv, J, Wang, G, Yu, JX, Yu, G, Lu, H & Sun, B 2003, A new path expression computing approach for XML data. in Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2590, Springer Verlag, pp. 35-46. https://doi.org/10.1007/3-540-36556-7_3

A new path expression computing approach for XML data. / Lv, Jianhua; Wang, Guoren; Yu, Jeffrey Xu et al.
Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers. Springer Verlag, 2003. p. 35-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2590).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A new path expression computing approach for XML data

AU - Lv, Jianhua

AU - Wang, Guoren

AU - Yu, Jeffrey Xu

AU - Yu, Ge

AU - Lu, Hongjun

AU - Sun, Bing

PY - 2003

Y1 - 2003

N2 - Most query languages in XML database systems use Regular Path Expressions (RPE) to query or extract data from databases and some query processing and optimization techniques have been proposed for RPEs. Conceptually XML documents are collections of path instances. Each path instance should conform to an XML element tag sequence, called path schema. A RPE query can be written as an automaton that can represent a language, while path schemas can be seen as sentences. In this paper, a novel RPE computing approach, automaton match (AM), is proposed. AM queries the RPEs by matching the automatons with path schemas. The experimental results show AM is quite efficient for computing RPE queries.

AB - Most query languages in XML database systems use Regular Path Expressions (RPE) to query or extract data from databases and some query processing and optimization techniques have been proposed for RPEs. Conceptually XML documents are collections of path instances. Each path instance should conform to an XML element tag sequence, called path schema. A RPE query can be written as an automaton that can represent a language, while path schemas can be seen as sentences. In this paper, a novel RPE computing approach, automaton match (AM), is proposed. AM queries the RPEs by matching the automatons with path schemas. The experimental results show AM is quite efficient for computing RPE queries.

UR - https://www.scopus.com/pages/publications/35248885624

U2 - 10.1007/3-540-36556-7_3

DO - 10.1007/3-540-36556-7_3

M3 - Conference contribution

AN - SCOPUS:35248885624

SN - 9783540007364

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

SP - 35

EP - 46

BT - Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers

PB - Springer Verlag

ER -

Lv J, Wang G, Yu JX, Yu G, Lu H, Sun B. A new path expression computing approach for XML data. In Efficiency and Effectiveness of XMLTools and Techniques and Data Integration over the Web, VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DIWeb, Revised Papers. Springer Verlag. 2003. p. 35-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36556-7_3

A new path expression computing approach for XML data

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this