• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Business Intelligence and Data Mining >Information graph-based creation of parallel queries for databases
【24h】

Information graph-based creation of parallel queries for databases

机译：基于信息图的数据库并行查询创建

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The article describes the query parallelisation method that takes into account the dependencies between operations in the data query. The method is based on the representation of the query as a directed graph with vertices as operations and edges as data connections. The graph is processed as an adjacency list, saving more memory than during processing a sparse adjacency matrix. The graph is modified only by operations, which do not change the elements of the adjacency list. Therefore it is possible to achieve intra-query parallelism by consideration of a request structure and implementation of mathematical methods of parallel calculations for its equivalent transformation. This article also presents an example of complex query parallelisation and describes applicability of the graph theory and methods of parallel computing both for query parallelisation and optimisation.
机译：本文介绍了查询并行化方法，该方法考虑了数据查询中操作之间的依赖性。该方法基于将查询表示为有向图，其中顶点作为操作，边作为数据连接。该图被作为邻接表处理，比处理稀疏邻接矩阵时节省更多的内存。只能通过操作来修改该图，这些操作不会更改邻接表的元素。因此，可以通过考虑请求结构和等效计算的并行计算数学方法的实现来实现查询内并行。本文还提供了一个复杂查询并行化的示例，并描述了图论和并行计算方法在查询并行化和优化方面的适用性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号