首页> 外文会议>International conference on computers and their applications >Performance Evaluations of Two Fast Join Query Processing Methods: Join Core and Join Indices
【24h】

Performance Evaluations of Two Fast Join Query Processing Methods: Join Core and Join Indices

机译:两种快速联接查询处理方法的性能评估:联接核心和联接索引

获取原文

摘要

Much research has been devoted to designing efficient join algorithms in the last few decades. In this paper, we compare two fastest join methods: Join indices and Join Core. Join indices generate index tables that contain tuples identifiers for matching tuples. Joins can be performed by scaning each input relation only once. On the other hand. Join Core is a data structure that stores join relationships to facilitate join query processing. With Join Core, join queries can be answered without having to perform costly join operations. We have implemented both methods and performed extensive experiments on TPC-H benchmark datasets and queries. Our experimental result shows that while both methods are much faster than conventional systems, such as MySQL. Join Core is the fastest.
机译:在过去的几十年中,许多研究致力于设计有效的联接算法。在本文中,我们比较了两种最快的联接方法:联接索引和联接核心。连接索引生成索引表,该表包含用于匹配元组的元组标识符。可以通过仅扫描每个输入关系一次来执行联接。另一方面。联接核心是一种存储联接关系以促进联接查询处理的数据结构。使用Join Core,可以回答联接查询,而不必执行昂贵的联接操作。我们已经实现了这两种方法,并对TPC-H基准数据集和查询进行了广泛的实验。我们的实验结果表明,尽管这两种方法都比传统系统(例如MySQL)要快得多。加入核心是最快的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号