Affiliation:
1. University of Edinburgh, Edinburgh
2. Bell Laboratories, Murray Hill, NJ
3. University of Pennsylvania, Philadelphia, PA
Abstract
Path constraints are capable of expressing inclusion and inverse relationships and have proved useful in modeling and querying semistructured data [Abiteboul and Vianu 1999; Buneman et al. 2000]. Types also constrain the structure of data and are commonly found in traditional databases. There has also been work on imposing structure or a type system on semistructured data for storing and querying semistructured data in a traditional database system [Alon et al. 2001; Deutsch et al. 1999a; Florescu and Kossmann 1999; Shanmugasundaram et al. 1999]. One wants to know whether complexity results for reasoning about path constraints established in the untyped (semistructured) context could carry over to traditional databases, and vice versa. It is therefore appropriate to understand the interaction between types and path constraints. In addition, XML [Bray et al. 1998], which may involve both an optional schema (e.g., DTDs or XML Schema [Thompson et al. 2001]) and integrity constraints, highlights the importance of the study of the interaction.This article investigates that interaction. In particular it studies constraint implication problems, which are important both in understanding the semantics of type/constraint systems and in query optimization. It shows that path constraints interact with types in a highly intricate way. For that purpose a number of results on path constraint implication are established in the presence and absence of type systems. These results demonstrate that adding a type system may in some cases simplify reasoning about path constraints and in other cases make it harder. For example, it is shown that there is a path constraint implication problem that is decidable in PTIME in the untyped context, but that becomes undecidable when a type system is added. On the other hand, there is an implication problem that is undecidable in the untyped context, but becomes not only decidable in cubic time but also finitely axiomatizable when a type system is imposed.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference32 articles.
1. Abiteboul S. Buneman P. and Suciu D. 2000. Data on the Web. From Relations to Semistructured Data and XML. Morgan Kaufman.]] Abiteboul S. Buneman P. and Suciu D. 2000. Data on the Web. From Relations to Semistructured Data and XML. Morgan Kaufman.]]
2. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.]] Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.]]
3. Regular Path Queries with Constraints
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Databases and Artificial Intelligence;A Guided Tour of Artificial Intelligence Research;2020
2. Extended tuple constraint type as a complex integrity constraint type in XML data model - definition and enforcement;Computer Science and Information Systems;2018
3. Extended Tuple Constraint Type in Relational and XML Data Model;Proceedings of the 8th Balkan Conference in Informatics;2017-09-20
4. XML Type Dependency and XML Type Normal Form;Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16;2016
5. The backchase revisited;The VLDB Journal;2013-09-08