Single-view determinacy and rewriting completeness for a fragment of XPath queries

一类 XPath 查询语句的视图确定性和重写完全性问题



研究一类含有通配符 (*)、 递归 (//)和分支 ([]) 操作的 XPath 查询语句的视图确定性和重写完全性问题。 证明出该类 XPath 语句的视图确定性问题是 coNP 难的, 并且该类语句是重写不完全的。 进而从语义和语法两个角度给出视图 V 确定查询 Q 的一系列必要条件, 以及一个判定视图确定性问题的非完全算法。 证明出对于一类特殊的 XPath 子类, 即只含有通配符和分支操作的 XPath 子类, 视图确定性问题可以在多项式时间内判定。 同时指出该子类的重写完全语言, 并给出一个从视图中计算查询结果的有效方法。

This is a preview of subscription content, access via your institution.


  1. 1

    Nash A, Segoufin L, Vianu V. Views and queries: determinacy and rewriting. ACM Trans Database Syst, 2010, 35: 21

    Article  Google Scholar 

  2. 2

    Fan W, Geerts F, Zheng L X. View determinacy for preserving selected information in data transformations. Inform Syst, 2012, 37: 1–12

    Article  Google Scholar 

  3. 3

    Gogacz T, Marcinkowski J. The hunt for a red spider: conjunctive query determinacy is undecidable. In: Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Kyoto, 2015. 281–292

    Google Scholar 

  4. 4

    Francis N. Asymptotic determinacy of path queries using union-of-paths views. In: Proceedings of the International Conference on Database Theory (ICDT), Brussels, 2015. 44–59

    Google Scholar 

  5. 5

    Miklau G, Suciu D. Containment and equivalence for a fragment of XPath. J ACM, 2004, 51: 2–45

    MathSciNet  Article  MATH  Google Scholar 

Download references

Author information



Corresponding author

Correspondence to Shuai Ma.

Additional information

The authors declare that they have no conflict of interest.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zheng, L., Ma, S., Luo, X. et al. Single-view determinacy and rewriting completeness for a fragment of XPath queries. Sci. China Inf. Sci. 59, 99102 (2016).

Download citation


  • XPath
  • 视图
  • 查询重写
  • 确定性
  • 复杂度