2009•Unpublished venueRequires access

Efficient processing of XML twig pattern matching based on extended region encoding labeling scheme

Shao-long Ma, Xinjun Wang, Feng Zhang, Ji Bian

Open publisher page 0 citations

Abstract

XML query technology has attracted more and more attention in data management research community. Finding all the occurrences of a twig pattern in an XML database is a core operation for XML queries. The previous approaches produce large set of intermediate results when they processing queries with parent-child relationship edges. We propose a new labeling scheme, called extended region encoding labeling scheme. From the label of an element, we can obtain all distinct tag names of its children. Based on this new labeling scheme, we design a holistic twig join algorithm TwigStackBE. Our main technique is before processing twig query we firstly check whether an element would contribute to the final solutions. So the set of intermediate results in twig pattern matching can be much smaller than previous algorithms. The experimental results indicate that the proposed algorithm performs better than the previous.

About this research paper

What this paper is about

XML query technology has attracted more and more attention in data management research community. Finding all the occurrences of a twig pattern in an XML database is a core operation for XML queries. The previous approaches produce large set of intermediate results when they processing queries with parent-child relationship edges. We propose a new labeling scheme, called extended region encoding labeling scheme. From the label of an element, we can obtain all distinct tag names of its children. Based on this new labeling scheme, we design a holistic twig join algorithm TwigStackBE. Our main technique is before processing twig query we firstly check whether an element would contribute to the final solutions. So the set of intermediate results in twig pattern matching can be much smaller than previous algorithms. The experimental results indicate that the proposed algorithm performs better than the previous.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

XML query technology has attracted more and more attention in data management research community. Finding all the occurrences of a twig pattern in an XML database is a core operation for XML queries. The previous approaches produce large set of intermediate results when they processing queries with parent-child relationship edges. We propose a new labeling scheme, called extended region encoding labeling scheme. From the label of an element, we can obtain all distinct tag names of its children. Based on this new labeling scheme, we design a holistic twig join algorithm TwigStackBE. Our main technique is before processing twig query we firstly check whether an element would contribute to the final solutions. So the set of intermediate results in twig pattern matching can be much smaller than previous algorithms. The experimental results indicate that the proposed algorithm performs better than the previous.

Key concepts: Twig, XML, Computer science, Encoding (memory), Scheme (mathematics), Matching (statistics), XML database, Pattern matching

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient processing of XML twig pattern matching based on extended region encoding labeling scheme — Research Paper | ScholarLens