【24h】

Querying Relational Databases without Explicit Joins

机译:查询没有显式联接的关系数据库

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

摘要

Despite its benefits and wide-spread acceptance, SQL is not a perfect query language. Although graphical tools for query construction mask some of the complexity, complex database schema challenge even experienced database users during query formulation because a user is responsible for mapping the semantics of their query to the structure of the database. In this work, we propose a semantic query language for graphically querying relational database systems that allows a user to query the database by semantics instead of structure. Database semantics are described using a global dictionary and semantic specifications that are combined to form an integrated, context view. Users query the semantic view by concept name, and the query processor translates semantic queries to SQL. This translation involves automatically determining attribute and relation mappings and join conditions.
机译:尽管SQL有其优点并得到了广泛的接受,但它并不是一种完美的查询语言。尽管用于查询构造的图形工具掩盖了某些复杂性,但是复杂的数据库架构甚至在有经验的数据库用户提出查询时都会遇到挑战,因为用户负责将其查询的语义映射到数据库的结构。在这项工作中,我们提出了一种用于图形化查询关系数据库系统的语义查询语言,该语言允许用户通过语义而不是结构来查询数据库。数据库语义是使用全局字典和语义规范来描述的,这些字典和语义规范组合在一起形成一个集成的上下文视图。用户通过概念名称查询语义视图,查询处理器将语义查询转换为SQL。这种转换涉及自动确定属性和关系映射以及联接条件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号