ON THE EVALUATION OF TREE PATTERN QUERIES

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

ON THE EVALUATION OF TREE PATTERN QUERIES

Topics: Information Retrieval

In Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT, 79-85, 2006 , Setúbal, Portugal

Author: Yangjun Chen

Affiliation: University of Winnipeg, Canada

Keyword(s): XML document, Tree pattern queries, Tree embedding, Constraint satisfaction problem, NP-complete.

Related Ontology Subjects/Areas/Topics: Applications ; Data Engineering ; Information Retrieval ; Ontologies and the Semantic Web ; Pattern Recognition ; Software Engineering

Abstract: The evaluation of Xpath expressions can be handled as a tree embedding problem. In this paper, we propose two strategies on this issue. One is ordered-tree embedding based and the other is unordered-tree embedding based. For the ordered-tree embedding, our algorithm needs only O(|T| x |P|) time and (|T| x |P|) space, where |T| and |P| stands for the numbers of the nodes in the target tree T and the pattern tree P, respectively. For the unordered-tree embedding, we give an algorithm that needs (|T| x |P|)x 22k) time, where k is the largest out-degree of any node in P.

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 18.188.20.56

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. (2006). ON THE EVALUATION OF TREE PATTERN QUERIES. In Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT; ISBN 978-972-8865-69-6; ISSN 2184-2833, SciTePress, pages 79-85. DOI: 10.5220/0001308700790085

@conference{icsoft06,
author={Yangjun Chen.},
title={ON THE EVALUATION OF TREE PATTERN QUERIES},
booktitle={Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT},
year={2006},
pages={79-85},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001308700790085},
isbn={978-972-8865-69-6},
issn={2184-2833},
}

TY - CONF

JO - Proceedings of the First International Conference on Software and Data Technologies - Volume 2: ICSOFT
TI - ON THE EVALUATION OF TREE PATTERN QUERIES
SN - 978-972-8865-69-6
IS - 2184-2833
AU - Chen, Y.
PY - 2006
SP - 79
EP - 85
DO - 10.5220/0001308700790085
PB - SciTePress