loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Author: Yangjun Chen

Affiliation: University of Winnipeg, Canada

ISBN: 978-972-8865-77-1

ISSN: 2184-3252

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

Related Ontology Subjects/Areas/Topics: Internet Technology ; Web Information Systems and Technologies ; XML and Data Management

Abstract: The twig join, which is used to find all occurrences of a twig pattern in an XML database, is a core operation for XML query processing. A great many strategies for handling this problem have been proposed and can be roughly classified into two groups. The first group decomposes a twig pattern (a small tree) into a set of binary relationships between pairs of nodes, such as parent-child and ancestor-descendant relations; and transforms a tree matching problem into a series of simple relation look-ups. The second group decomposes a twig pattern into a set of paths. Among all this kind of methods, the approach based on the so-called stack encoding [N. Bruno, N. Koudas, and D. Srivastava, Holistic Twig Hoins: Optimal XML Pattern Matching, in Proc. SIGMOD Int. Conf. on Management of Data, Madison, Wisconsin, June 2002, pp. 310-321] is very interesting, which can represent in linear space a potentially exponential (in the number of query nodes) number of matching paths. However, the availa ble processes for generating such compressed paths suffer some redundancy and can be significantly improved. In this paper, we analyze this method and show that the time complexities of path generation in its two main procedures: TwigStack and TwigStackXB can be reduced from O(m2n) to O(mn), where m and n are the sizes of the query tree and document tree, respectively. Experiments have been done to compare TwigStackXB and ours, which shows that using our method much less time is needed to generate matching paths. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

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

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. and (2007). STACK ENCODING REVISITED.In Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 2: WEBIST, ISBN 978-972-8865-77-1, pages 5-14. DOI: 10.5220/0001260800050014

@conference{webist07,
author={Yangjun Chen},
title={STACK ENCODING REVISITED},
booktitle={Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 2: WEBIST,},
year={2007},
pages={5-14},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001260800050014},
isbn={978-972-8865-77-1},
}

TY - CONF

JO - Proceedings of the Third International Conference on Web Information Systems and Technologies - Volume 2: WEBIST,
TI - STACK ENCODING REVISITED
SN - 978-972-8865-77-1
AU - Chen, Y.
PY - 2007
SP - 5
EP - 14
DO - 10.5220/0001260800050014

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.