Affiliation:
1. INRIA and Université Paris
Abstract
Most theoretical work on static analysis for XML and its query languages models XML documents by labeled ordered unranked trees, where the labels are from a finite set. Attribute values are usually ignored. This was quite successful for many applications like, to mention only some of them, the study of the navigational fragment of XPath known as
Core-XPath
[20], a complete picture of the complexity of satisfiability and inclusion of XPath queries without joins [4], XML-schema design with no integrity constraints [28, 31], type-checking [40]. The reader is invited to have a look at the Database Theory columns [32, 37, 40, 39] for an introduction on this rich production.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference40 articles.
1. XML Path Language (XPath). Available at http://www.w3.org/TR/2002/WD-xpath20-20020816. XML Path Language (XPath). Available at http://www.w3.org/TR/2002/WD-xpath20-20020816.
2. XML with data values: typechecking revisited
3. Langages sur des alphabets infinis
4. XPath satisfiability in the presence of DTDs
5. Two-variable logic on data trees and XML reasoning
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Evaluating Complex Queries on Streaming Graphs;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
2. Schema Mappings for Data Graphs;Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2017-05-09
3. Query Planning for Evaluating SPARQL Property Paths;Proceedings of the 2016 International Conference on Management of Data;2016-06-26
4. Querying Graphs with Data;Journal of the ACM;2016-05-04
5. Highly Expressive Query Languages for Unordered Data Trees;Theory of Computing Systems;2015-04-14