首页> 外文会议>Proceedings of the Twenty-third international conference on very large data bases >Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates
【24h】

Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates

机译:带有子集连接谓词的连接的主内存连接算法的评估

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

摘要

Current data models like the NF~2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates two main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on subset predicates.
机译:当前的数据模型(例如NF〜2模型和面向对象的模型)支持集值属性。因此,有可能基于集合比较而具有连接谓词。本文介绍并评估了两种主要的存储算法,以有效地评估这种连接。更具体地说,我们专注于子集谓词。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号