UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES

Yangjun Chen

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES

Topics: Data Storage and Query Processing

In Proceedings of the 4th International Conference on Software and Data Technologies - Volume 2: ICSOFT, 191-198, 2009 , Sofia, Bulgaria

Author: Yangjun Chen

Affiliation: University of Winnipeg, Canada

Keyword(s): Tree mapping, Tree pattern queries, XML databases, Query evaluation, Tree encoding.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Data Management and Quality ; Data Storage and Query Processing

Abstract: With the growing importance of XML in data ex¬change, much research has been done in providing flexible query facilities to extract data from structured XML docu¬ments. In this paper, we discuss an efficient algorithm for tree mapping problem in XML databases based on unordered tree matching. Given a target tree T and a pattern tree Q, the algorithm can find all the embeddings of Q in T in O(|D||Q|) time, where D is a largest data stream associated with a node of Q. More importantly, the algorithm is index-oriented: with XB-trees constructed over data streams, disk access can be dramatically decreased.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.17.128.129

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Chen, Y. (2009). UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES. In Proceedings of the 4th International Conference on Software and Data Technologies - Volume 2: ICSOFT; ISBN 978-989-674-010-8; ISSN 2184-2833, SciTePress, pages 191-198. DOI: 10.5220/0002238801910198

@conference{icsoft09,
author={Yangjun Chen.},
title={UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES},
booktitle={Proceedings of the 4th International Conference on Software and Data Technologies - Volume 2: ICSOFT},
year={2009},
pages={191-198},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002238801910198},
isbn={978-989-674-010-8},
issn={2184-2833},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Software and Data Technologies - Volume 2: ICSOFT
TI - UNORDERED TREE MATCHING AND TREE PATTERN QUERIES IN XML DATABASES
SN - 978-989-674-010-8
IS - 2184-2833
AU - Chen, Y.
PY - 2009
SP - 191
EP - 198
DO - 10.5220/0002238801910198
PB - SciTePress