TREE EMBEDDING AND XML QUERY EVALUATION

Yangjun Chen

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

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

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

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

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

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

Name:
Country:
Subject:

Advanced Search Affiliations Search

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

Proceedings

Proceedings Search

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

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

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

TREE EMBEDDING AND XML QUERY EVALUATION

Topics: Multimedia Database Applications; Web Databases

In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 4: ICEIS, 173-178, 2008 , Barcelona, Spain

Author: Yangjun Chen

Affiliation: University of Winnipeg, Canada

Keyword(s): XML databases, Trees, Paths, XML pattern matching, Twig joins.

Related Ontology Subjects/Areas/Topics: Databases and Information Systems Integration ; Enterprise Information Systems ; Multimedia Database Applications ; Web Databases

Abstract: Tree pattern matching is one of the most fundamental tasks for XML query processing. Prior work has typically decomposed the tree pattern into binary structural (parent-child and ancestor-descendent) relationships or paths, and then stitch together these basic matches by join operations. In this paper, we propose a new algorithm that explores both the document tree and the twig pattern in a bottom-up way and show that the join operation can be completely avoided. The new algorithm runs in O(|T|×|Q|) time and O(|Q|×leafT) space, where T and Q are the document tree and the tree pattern query, respectively; and leafT represents the number of leaf nodes in T.

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 13.58.82.79

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. (2008). TREE EMBEDDING AND XML QUERY EVALUATION. In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 4: ICEIS; ISBN 978-989-8111-36-4; ISSN 2184-4992, SciTePress, pages 173-178. DOI: 10.5220/0001690301730178

@conference{iceis08,
author={Yangjun Chen.},
title={TREE EMBEDDING AND XML QUERY EVALUATION},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 4: ICEIS},
year={2008},
pages={173-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001690301730178},
isbn={978-989-8111-36-4},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 4: ICEIS
TI - TREE EMBEDDING AND XML QUERY EVALUATION
SN - 978-989-8111-36-4
IS - 2184-4992
AU - Chen, Y.
PY - 2008
SP - 173
EP - 178
DO - 10.5220/0001690301730178
PB - SciTePress