Complexity of Data Tree Patterns over XML Documents

@inproceedings{David2008ComplexityOD,
  title={Complexity of Data Tree Patterns over XML Documents},
  author={Claire David},
  booktitle={MFCS},
  year={2008}
}
We consider Boolean combinations of data tree patterns as a specification and query language for XML documents. Data tree patterns are tree patterns plus variable (in)equalities which express joins between attribute values. Data tree patterns are a simple and natural formalism for expressing properties of XML documents. We consider first the model checking problem (query evaluation), we show that it is DP-complete in general and already NP-complete when we consider a single pattern. We then… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS
25 Citations
21 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…