A NEW ALGORITHM FOR TWIG PATTERN MATCHING

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

A NEW ALGORITHM FOR TWIG PATTERN MATCHING

Topics: Web Databases

In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS, 44-51, 2007 , Funchal, Madeira, Portugal

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 ; Web Databases

Abstract: Tree pattern matching is one of the most fundamental tasks for XML query processing. Prior work has typically decomposed the twig 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 twig pattern query, respectively; and leafT represents the number of leaf nodes in T. Our experiments show that our method is effective, scalable and efficient in evaluating twig pattern queries.

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.143.4.181

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. (2007). A NEW ALGORITHM FOR TWIG PATTERN MATCHING. In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS; ISBN 978-972-8865-88-7; ISSN 2184-4992, SciTePress, pages 44-51. DOI: 10.5220/0002356300440051

@conference{iceis07,
author={Yangjun Chen.},
title={A NEW ALGORITHM FOR TWIG PATTERN MATCHING},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS},
year={2007},
pages={44-51},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002356300440051},
isbn={978-972-8865-88-7},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS
TI - A NEW ALGORITHM FOR TWIG PATTERN MATCHING
SN - 978-972-8865-88-7
IS - 2184-4992
AU - Chen, Y.
PY - 2007
SP - 44
EP - 51
DO - 10.5220/0002356300440051
PB - SciTePress