id="info"

Containment of Pattern-Based Queries over Data Trees

The authors study static analysis, in particular the containment problem, for analogs of conjunctive queries over XML documents. The problem has been studied for queries based on arbitrary patterns, not necessarily following the tree structure of documents. However, many applications force the syntactic shape of queries to be tree-like, as they are based on proper tree patterns. This renders previous results, crucially based on having non-tree-like features, inapplicable. Thus, they investigate static analysis of queries based on proper tree patterns.

Provided by: Association for Computing Machinery Topic: Data Management Date Added: Feb 2013 Format: PDF

Find By Topic