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

^*此作品的通讯作者

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

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

1 引用（Scopus）

摘要

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.

源语言	英语
主期刊名	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
页	35-46
页数	12
ISBN（印刷版）	9783540007364
DOI	https://doi.org/10.1007/3-540-36556-7_3
出版状态	已出版 - 2003
已对外发布	是

出版系列

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	2590
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

访问文件

10.1007/3-540-36556-7_3

其它文件与链接

链接到 Scopus 的出版物

引用此

Lv, J., Wang, G., Yu, J. X., Yu, G., Lu, H., & Sun, B. (2003). 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 (页码 35-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 2590). Springer Verlag. https://doi.org/10.1007/3-540-36556-7_3

Lv, Jianhua ; Wang, Guoren ; Yu, Jeffrey Xu 等. / 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. 页码 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. 在 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), 卷 2590, Springer Verlag, 页码 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 等.
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. 页码 35-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 2590).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

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. 在 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. 页码 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

摘要

出版系列

访问文件

其它文件与链接

指纹

引用此