logo

SCIENCE CHINA Information Sciences, Volume 59, Issue 9: 099102(2016) https://doi.org/10.1007/s11432-016-5603-z

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

More info
  • ReceivedOct 9, 2015
  • AcceptedFeb 3, 2016
  • PublishedAug 23, 2016

Abstract


Acknowledgment

Acknowledgments

Zheng is supported in part by NSFC ({\small 61472405&61502184}) and NSF of Fujian Province ({\small 2015J01259}). Ma is supported in part by 973 Program ({\small 2014CB340300}) and NSFC ({\small 61322207&61421003}). Luo is supported in part by NSFC ({\small 61170028}) and Promotion Program for Young and Middle-aged Teachers in Science and Technology Research of Huaqiao University ({\small ZQN-YX109}).


References

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

[2] Fan W, Geerts F, Zheng L X. View determinacy for preserving selected information in data transformations. Inform Syst, 2012, 37: 1-12 CrossRef Google Scholar

[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] 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] Miklau G, Suciu D. Containment and equivalence for a fragment of {XPath}. J ACM, 2004, 51: 2-45 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1