Interaction between path and type constraints

Author:

Buneman Peter1,Fan Wenfei2,Weinstein Scott3

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3