Effective information disclosure in the context of databases with a large conceptual schema is known to be a non-trivial problem. In particular the formulation of ad-hoc queries is a major problem in such contexts. Existing approaches for tackling this problem include graphical query interfaces, query by navigation, and query by construction. In this article we propose the {\em point to point query mechanism} that can be combined with the existing mechanism into an unprecedented computer supported query formulation mechanism. In a point to point query a path through the information structure is build. This path can then be used to formulate more complex queries. A point to point query is typically useful when users know some object types which are relevant for their information need, but do not (yet) know how they are related in the conceptual schema. Part of the point to point query mechanism is therefore the selection of the most appropriate path between object types (points) in the conceptual schema. This article both discusses some of the pragmatic issues involved in the point to point query mechanism, and the theoretical issues involved in finding the relevant paths between selected object types.
翻译：在具有大量概念性模式的数据库中,已知有效的信息披露是一个非三重问题。 特别是在这种情况下, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 特别地, 处理 这个问题的现有 方法 包括 图形查询 界面 、 导航 和 构造 的 查询 。 在此条中, 我们提议 \ em 指 点 质 机制, 可以 与 前所未有的 计算机 辅助 查询 机制 结合 。 在 点 点 路径 中 的 点 点, 和 查找 选定 对象 类型 之间 的 理论 问题 。
相关内容
微信扫码咨询专知VIP会员