SIMP: Efficient XML Structural Index for Multiple Query Processing

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.

Download Full-text

Divide and conquer: A basis for augmenting a conventional query optimizer with multiple query-processing capabilities

[1991] Proceedings. Seventh International Conference on Data Engineering ◽

10.1109/icde.1991.131497 ◽

2002 ◽

Cited By ~ 8

Author(s):

S. Chakravarthy

Keyword(s):

Query Processing ◽

Divide And Conquer ◽

Query Optimizer ◽

Multiple Query

Download Full-text

XML Stream Processing

Advanced Applications and Structures in XML Processing ◽

10.4018/978-1-61520-727-5.ch009 ◽

2010 ◽

pp. 184-206

Author(s):

Junichi Tatemura

Keyword(s):

Query Processing ◽

Time Complexity ◽

Stream Processing ◽

Query Evaluation ◽

Streaming Algorithms ◽

Buffer Memory ◽

Recent Advances ◽

Xml Stream ◽

Multiple Query ◽

Partial Query

This chapter reviews recent advances on stream XML query evaluation algorithms with stack-based encoding of intermediary data. Originally proposed for disk-resident XML, the stack-based architecture has been extended for streaming algorithms for both single and multiple query processing, ranging from XPath filtering to more complex XQuery. The key benefit of the stack-based architecture is its succinct encoding of partial query results, which can cause exponential enumeration if encoded naively. In addition, the chapter discusses opportunities to integrate benefits demonstrated in the reviewed work. For single-query processing, a sketch is given for an integrated algorithm, StreamTwig2Stack, that achieves all the benefits of existing algorithms in terms of functionality, time complexity, and buffer memory optimality.

Download Full-text