首页> 外文会议>Database and Expert Systems Applications >On Formulation of Disjunctive Coupling Queries in Whoweda
【24h】

On Formulation of Disjunctive Coupling Queries in Whoweda

机译:关于Whoweda中析取耦合查询的表述

获取原文

摘要

We describe how to formulate coupling query to glean relevant Web data in the context of our web warehousing system called WHOWEDA (Warehouse Of Web Data). One of the important feature of our query mechanism is the ability to express disjunctive query conditions compactly. We describe how to formulate coupling queries in text form as well as pictorially using coupling text and coupling graph. We explore the limitations of coupling graph with respect to coupling text. We found out that AND, OR and AND/OR-coupling graphs are less expressive than their textual counterparts. To address this shortcoming we introduced another query formulation technique called hybrid graph which is a special type of p-connected coupling graph.
机译:我们描述了如何在称为WHOWEDA(Web数据仓库)的Web仓库系统的上下文中制定耦合查询以收集相关的Web数据。我们的查询机制的重要特征之一就是能够紧凑地表达析取查询条件。我们描述了如何以文本形式以及使用耦合文本和耦合图来图形化地表示耦合查询。我们探讨了耦合图相对于耦合文本的局限性。我们发现,AND,OR和AND / OR耦合图的表达力不及其文字对应图。为了解决这个缺点,我们引入了另一种称为混合图的查询表述技术,该技术是一种特殊的p型连接图。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号