Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation

Schmidt, Michael D.; Scherzinger, Stefanie; Koch, Christoph

doi:10.1109/icde.2007.367869

Cited by 18 publications

(26 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare our implementation to the XPath engines GCX [19], Spex [16], XMLtk [11], XSLTproc [21], XSQ [17] and YFilter [9]. We also compare our implementation to XMLWF [7], which only checks for a well-formed XML document.…”

Section: Implemented (26)mentioning

confidence: 99%

See 1 more Smart Citation

Stream firewalling of xml constraints

Benedikt

Jeffrey²,

Ley-Wild

2008

Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML stream firewalling problem; that of applying integrity constraints against a large number of simultaneous streams. We conduct the first investigation of a constraint engine optimized for the generation of XML stream firewalls. We isolate a class of DTDs and XPath constraints which support the generation of low-space filters, and provide algorithms for generating firewalls with low per-input-character time and per-stream space. We give experimental results which show that we have achieved these goals in practice.

show abstract

Section: Implemented (26)mentioning

confidence: 99%

“…We provide details of an implementation of a BDD-based XPath processor which can execute constraint-checks extremely rapidly, and compare the performance with stateof-the-art XPath filtering engines such as XMLtk [11], YFilter [9], XSQ [17], and GCX [19].…”

Section: Not(//message[@type="get"]/body)mentioning

confidence: 99%

Stream firewalling of xml constraints

Benedikt

Jeffrey²,

Ley-Wild

2008

Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

show abstract

“…In our experiments, we use both real and synthetic datasets that differ in size and characteristics. We test the performance of our method on two real datasets, DBLP [17] and Treebank [24] , and one synthetic dataset, XMark [22]. Through SAX analyze these datasets to simulate the data coming in streaming format.…”

Section: Experimental Settingsmentioning

confidence: 99%

“…Although this approach supports following and following sibling axes, it does not support logic predicates that include 'and', 'or', 'not'. GCX [24] system proposes a buffer management scheme which combines static and dynamic analysis for efficiency in memory usage and streaming XQuery processing. This method combines the technique of projection for pre-filtering data which is irrelevant to query evaluation and the technique of dynamic garbage collection for automatic memory management.…”

Section: Stream-querying Algorithmsmentioning

confidence: 99%

An XML Streaming Data Processing Method based on Forest Transducer

He¹

2017

IJPE

View full text Add to dashboard Cite

XML is the de facto standard for data representation and exchanging on web. The query processing technique of XML streaming data is a hotspot in current research. Focused on the characteristics of processing semi-structure XML streaming data such as the stream arriving continuously, requiring to be read sequentially and only once into memory, the querying must be processed on the fly, a method of processing XPath query based on forest transducer is proposed. Firstly, conversion rules of forest transducer are defined for XPath query. And then the transducer is driven by input streaming data nodes. Stack and abstract syntax tree are applied to implement match and state transformation in running procedure. The relationships between state functions and intermediate results are kept by the abstract syntax tree, and the query results are output in reducing process. Finally, the experimental results show that our approach is effective and efficient on this problem, and outperforms about 30 percent of the state-of-the-art algorithms especially for large processed data. At the same time, memory usage is nearly constant. This method resolves the balance between time and space complexity, and it is a useful reference for other methods.

show abstract

“…We first ran both FBST and CTPQ to minimize the input queries on both XMark and DBLP datasets, and then evaluated the respective minimized queries on the XML datasets using the efficient query evaluation engine, GCX [16].…”

Section: Comparison Of Total Processing Timementioning

confidence: 99%

Minimization of tree pattern queries with constraints

Chan

2008

Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. Since the size of a TPQ is a key determinant of its evaluation cost, recent research has focused on the problem of query minimization using integrity constraints to eliminate redundant query nodes; specifically, TPQ minimization has been studied for the class of forward and subtype constraints (FT-constraints). In this paper, we explore the TPQ minimization problem further for a richer class of FBST-constraints that includes not only FT-constraints but also backward and sibling constraints. By exploiting the properties of minimal queries under FBST-constraints, we propose efficient algorithms to both compute a single minimal query as well as enumerate all minimal queries. In addition, we also develop more efficient minimization algorithms for the previously studied class of FT-constraints. Our experimental study demonstrates the effectiveness and efficiency of query minimization using FBST-constraints.

show abstract

Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation

Cited by 18 publications

References 12 publications

Stream firewalling of xml constraints

Stream firewalling of xml constraints

An XML Streaming Data Processing Method based on Forest Transducer

Minimization of tree pattern queries with constraints

Contact Info

Product

Resources

About