Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient XML tree pattern query evaluation using a novel one‐phase holistic twig join scheme

Efficient XML tree pattern query evaluation using a novel one‐phase holistic twig join scheme Purpose – The purpose of this paper is to provide an efficient algorithm for Extensible Markup Language (XML) twig query evaluation. Design/methodology/approach – A single‐phase holistic twig pattern matching method based on the TwigStack algorithm is proposed. The method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the root stack are output directly. Findings – Without generating individual path matches as intermediate results, the method is able to avoid the storage and output/input of the individual path matches, and totally eliminate the potentially time‐consuming merging operation. Experimental results demonstrate the applicability and advantages of our approach. Originality/value – The paper proposes an efficient XML twig query evaluation algorithm, which by both theoretical analyses and empirical studies demonstrates its advantages over the current state‐of‐the‐art algorithm TwigStack. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Information Systems Emerald Publishing

Efficient XML tree pattern query evaluation using a novel one‐phase holistic twig join scheme

Loading next page...
 
/lp/emerald-publishing/efficient-xml-tree-pattern-query-evaluation-using-a-novel-one-phase-lA7gNnpqaS

References (24)

Publisher
Emerald Publishing
Copyright
Copyright © 2009 Emerald Group Publishing Limited. All rights reserved.
ISSN
1744-0084
DOI
10.1108/17440080910983565
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to provide an efficient algorithm for Extensible Markup Language (XML) twig query evaluation. Design/methodology/approach – A single‐phase holistic twig pattern matching method based on the TwigStack algorithm is proposed. The method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the root stack are output directly. Findings – Without generating individual path matches as intermediate results, the method is able to avoid the storage and output/input of the individual path matches, and totally eliminate the potentially time‐consuming merging operation. Experimental results demonstrate the applicability and advantages of our approach. Originality/value – The paper proposes an efficient XML twig query evaluation algorithm, which by both theoretical analyses and empirical studies demonstrates its advantages over the current state‐of‐the‐art algorithm TwigStack.

Journal

International Journal of Web Information SystemsEmerald Publishing

Published: Aug 28, 2009

Keywords: Databases; Query languages; Extensible Markup Language; Programming and algorithm theory

There are no references for this article.