公开(公告)号：US20160335322A1

公开(公告)日：2016-11-17

申请号：US14710117

申请日：2015-05-12

Applicant: Oracle International Corporation

Inventor： Manuel Then ,  Sungpack Hong ,  Martin Sevenich ,  Hassan Chafi

IPC: G06F17/30

CPC classification number: G06F17/30958

Abstract: Techniques are described herein for automatic generation of multi-source breadth-first search (MS-BFS) from high-level graph processing language. In an embodiment, a method involves a computer analyzing original software instructions. The original software instructions are configured to perform multiple breadth-first searches to determine a particular result. Each breadth-first search originates at each of a subset of vertices of a graph. Each breadth-first search is encoded for independent execution. Based on the analyzing, the computer generates transformed software instructions configured to perform a MS-BFS to determine the particular result. Each of the subset of vertices is a source of the MS-BFS. In an embodiment, parallel execution of the MS-BFS is regulated with batches of vertices. In an embodiment, the original software instructions are expressed in Green-Marl graph analysis language. In an embodiment, the transformed software instructions are expressed in a general purpose programing language such as C, C++, Python, or Java.

Abstract translation: 本文描述了用于从高级图处理语言自动生成多源宽度优先搜索（MS-BFS）的技术。 在一个实施例中，一种方法涉及计算机分析原始软件指令。 原始软件指令被配置为执行多个宽度优先搜索以确定特定结果。 每个宽度优先搜索起始于图形的顶点的每个子集。 每个宽度优先的搜索被编码用于独立执行。 基于分析，计算机生成经配置以执行MS-BFS以确定特定结果的变换软件指令。 顶点子集中的每一个都是MS-BFS的源。 在一个实施例中，通过批次的顶点来调节MS-BFS的并行执行。 在一个实施例中，原始软件指令以格林 - 马尔图分析语言表示。 在一个实施例中，变换的软件指令以诸如C，C ++，Python或Java的通用程序语言表达。

公开(公告)号：US10133827B2

公开(公告)日：2018-11-20

申请号：US14710117

申请日：2015-05-12

Applicant: Oracle International Corporation

Inventor： Manuel Then ,  Sungpack Hong ,  Martin Sevenich ,  Hassan Chafi

IPC: G06F17/30

Abstract: Techniques are described herein for automatic generation of multi-source breadth-first search (MS-BFS) from high-level graph processing language. In an embodiment, a method involves a computer analyzing original software instructions. The original software instructions are configured to perform multiple breadth-first searches to determine a particular result. Each breadth-first search originates at each of a subset of vertices of a graph. Each breadth-first search is encoded for independent execution. Based on the analyzing, the computer generates transformed software instructions configured to perform a MS-BFS to determine the particular result. Each of the subset of vertices is a source of the MS-BFS. In an embodiment, parallel execution of the MS-BFS is regulated with batches of vertices. In an embodiment, the original software instructions are expressed in Green-Marl graph analysis language. In an embodiment, the transformed software instructions are expressed in a general purpose programming language such as C, C++, Python, or Java.