首页> 外文会议>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.
机译:在过去的几十年中,已经致力于设计有效的加入算法的研究。在本文中,我们比较两个最快的连接方法:加入索引并加入核心。加入索引生成包含组元组标识符的索引表。可以通过仅扫描每个输入关系一次来执行联接。另一方面。加入核心是一种数据结构,可以存储加入关系,以便于加入查询处理。使用加入核心,可以回答加入查询,而无需执行昂贵的加入操作。我们已经实施了两种方法,并在TPC-H基准数据集和查询上进行了广泛的实验。我们的实验结果表明,虽然两种方法比传统系统更快,例如MySQL。加入核心是最快的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号