F-Index: A Flattened Structural Index for Speeding up Twig Query Processing

2007 ◽  
Vol 18 (4) ◽  
pp. 1429
Author(s):  
Jun-Feng ZHOU
Keyword(s):  
Query Processing ◽  
Structural Index ◽  
Twig Query

Distributed XML Twig Query Processing Using MapReduce

2015 ◽  
pp. 203-214 ◽  
Author(s):  
Xin Bi ◽  
Guoren Wang ◽  
Xiangguo Zhao ◽  
Zhen Zhang ◽  
Shuang Chen
Keyword(s):  
Query Processing ◽  
Twig Query

Twig query processing over graph-structured XML data

2004 ◽  
Author(s):  
Zografoula Vagena ◽  
Mirella M. Moro ◽  
Vassilis J. Tsotras
Keyword(s):  
Query Processing ◽  
Xml Data ◽  
Twig Query

A XML Pattern Match Algorithm of Structural Index

2014 ◽  
Vol 513-517 ◽  
pp. 1507-1510 ◽  
Author(s):  
Si Li Li ◽  
Jin Zhu
Keyword(s):  
Query Processing ◽  
Sibling Relationships ◽  
Pattern Match ◽  
Structural Index ◽  
Xml Query Processing ◽  
Match Algorithm ◽  
Xml Document ◽  
Labeling Scheme ◽  
Better Than ◽  
Parent Child

XML query processing needs to search an XML document and return results that satisfy a request. In this paper, we proposed an effective pattern match algorithm based on structural index. This algorithm uses a suitable labeling scheme and an efficient structural index by identifying parent-child, ancestor-descendant and sibling relationships among nodes. Due to the algorithm avoids invalid immoderate results to be pushed stacks, So, It reduces the amount of joint and improves the performance of Query. Experiment results proved that our algorithm, TwigM performs about 15% better compared to TwigStack [ and 10% better than TwigINLAB[ for all types of queries.

Sign in / Sign up

Export Citation Format

Share Document