首页> 外文会议>Database theory - ICDT'99 >An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
【24h】

An Equational Chase for Path-Conjunctive Queries, Constraints, and Views

机译:路径合取查询,约束和视图的方程式追赶

获取原文
获取原文并翻译 | 示例

摘要

We consider the class of path-conjunctive queries and constraints (dependencies) denned over complex values with dictionaries. This class includes the relational conjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class.
机译:我们考虑通过字典在复杂值上定义的路径连接查询和约束(依赖项)的类。此类包括关系联合查询和嵌入式依赖关系,以及许多有趣的示例,包括复杂值和oodb查询以及完整性约束。我们表明,关于遏制,依赖关系和追赶的一些重要经典结果扩展并推广到此类。

著录项

  • 来源
    《Database theory - ICDT'99》|1999年|39-57|共19页
  • 会议地点 Jerusalem(IL);Jerusalem(IL)
  • 作者

    Lucian Popa; Val Tannen;

  • 作者单位

    University of Pennsylvania,Department of Computer and Information Science,200 South 33rd Street, Philadelphia, PA 19104, USA;

    University of Pennsylvania,Department of Computer and Information Science,200 South 33rd Street, Philadelphia, PA 19104, USA;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 各种专用数据库;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号