中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.016 seconds)

    Constructing an in-memory representation of a graph
    2.
    发明授权
    Constructing an in-memory representation of a graph 有权

    公开(公告)号：US10055509B2

    公开(公告)日：2018-08-21

    申请号：US14680150

    申请日：2015-04-07

    Applicant: Oracle International Corporation

    Inventor： Sungpack Hong ,  Zhe Wu ,  Korbinian Schmid ,  Felix Kaser ,  Martin Sevenich ,  Hassan Chafi ,  Jayanta Banerjee

    IPC: G06F17/30 ,  G06F17/00

    CPC classification number: G06F16/9024 ,  G06F16/2246 ,  G06F2201/80

    Abstract: Techniques for efficiently loading graph data into memory are provided. A plurality of node ID lists are retrieved from storage. Each node ID list is ordered based on one or more order criteria, such as node ID, and is read into memory. A new list of node IDs is created in memory and is initially empty. From among the plurality of node ID lists, a particular node ID is selected based on the one or more order criteria, removed from the node ID list where the particular node ID originates, and added to the new list. This process of selecting, removing, and adding continues until no more than one node ID list exists, other than the new list. In this way, the retrieval of the plurality of node ID lists from storage may be performed in parallel while the selecting and adding are performed sequentially.

    ADVANCED INTERACTIVE COMMAND-LINE FRONT-END FOR GRAPH ANALYSIS SYSTEMS
    3.
    发明申请
    ADVANCED INTERACTIVE COMMAND-LINE FRONT-END FOR GRAPH ANALYSIS SYSTEMS 有权
    图形分析系统的先进交互式命令前端

    公开(公告)号：US20170024192A1

    公开(公告)日：2017-01-26

    申请号：US14805882

    申请日：2015-07-22

    Applicant: Oracle International Corporation

    Inventor： Sungpack Hong ,  Korbinian Schmid ,  Felix Kaser ,  Hassan Chafi

    IPC: G06F9/45

    CPC classification number: G06F8/41 ,  G06F8/30 ,  G06F8/441 ,  G06F8/443 ,  G06F8/445 ,  G06F9/45512

    Abstract: Systems and methods for interactive front-end graph analysis are provided herein. According to one embodiment, a front-end application receives, from a compiler, first meta-information for a particular graph analysis procedure, where the first meta-information identifies a set of input parameters for passing graph information to the particular graph analysis procedure. The front-end application registers, using the first meta-information, the particular graph analysis procedure as an available command. The front-end application also receives second meta-information that identifies, for each respective graph object of a set of one or more graph objects, a respective set of graph characteristics. In response to receiving a request to apply the particular graph analysis procedure to the set of one or more graph objects, the front-end application enforces a set of one or more constraints based on the first meta-information and the second meta-information.

    Abstract translation: 本文提供了交互式前端图分析的系统和方法。 根据一个实施例，前端应用从编译器接收用于特定图分析过程的第一元信息，其中第一元信息识别用于将图信息传递到特定图分析过程的一组输入参数。 前端应用程序使用第一个元信息将特定图分析过程注册为可用命令。 前端应用还接收第二元信息，其针对一个或多个图形对象的集合的每个相应图形对象标识相应的图形特征集合。 响应于接收到将特定图形分析过程应用于一个或多个图形对象的集合的请求，前端应用基于第一元信息和第二元信息强制执行一组或多个约束。

    Advanced interactive command-line front-end for graph analysis systems
    4.
    发明授权
    Advanced interactive command-line front-end for graph analysis systems 有权
    用于图形分析系统的高级交互式命令行前端

    公开(公告)号：US09575736B2

    公开(公告)日：2017-02-21

    申请号：US14805882

    申请日：2015-07-22

    Applicant: Oracle International Corporation

    Inventor： Sungpack Hong ,  Korbinian Schmid ,  Felix Kaser ,  Hassan Chafi

    IPC: G06F9/45 ,  G06F9/44

    CPC classification number: G06F8/41 ,  G06F8/30 ,  G06F8/441 ,  G06F8/443 ,  G06F8/445 ,  G06F9/45512

    Abstract: Systems and methods for interactive front-end graph analysis are provided herein. According to one embodiment, a front-end application receives, from a compiler, first meta-information for a particular graph analysis procedure, where the first meta-information identifies a set of input parameters for passing graph information to the particular graph analysis procedure. The front-end application registers, using the first meta-information, the particular graph analysis procedure as an available command. The front-end application also receives second meta-information that identifies, for each respective graph object of a set of one or more graph objects, a respective set of graph characteristics. In response to receiving a request to apply the particular graph analysis procedure to the set of one or more graph objects, the front-end application enforces a set of one or more constraints based on the first meta-information and the second meta-information.

    Abstract translation: 本文提供了交互式前端图分析的系统和方法。 根据一个实施例，前端应用从编译器接收用于特定图分析过程的第一元信息，其中第一元信息识别用于将图信息传递到特定图分析过程的一组输入参数。 前端应用程序使用第一个元信息将特定图分析过程注册为可用命令。 前端应用还接收第二元信息，其针对一个或多个图形对象的集合的每个相应图形对象标识相应的图形特征集合。 响应于接收到将特定图形分析过程应用于一个或多个图形对象的集合的请求，前端应用基于第一元信息和第二元信息强制执行一组或多个约束。

    CONSTRUCTING AN IN-MEMORY REPRESENTATION OF A GRAPH
    5.
    发明申请
    CONSTRUCTING AN IN-MEMORY REPRESENTATION OF A GRAPH 审中-公开
    构建图形的内存表示

    公开(公告)号：US20160299991A1

    公开(公告)日：2016-10-13

    申请号：US14680150

    申请日：2015-04-07

    Applicant: Oracle International Corporation

    Inventor： Sungpack Hong ,  Zhe Wu ,  Korbinian Schmid ,  Felix Kaser ,  Martin Sevenich ,  Hassan Chafi ,  Jayanta Banerjee

    IPC: G06F17/30

    CPC classification number: G06F17/30958 ,  G06F17/30327 ,  G06F2201/80

    Abstract: Techniques for efficiently loading graph data into memory are provided. A plurality of node ID lists are retrieved from storage. Each node ID list is ordered based on one or more order criteria, such as node ID, and is read into memory. A new list of node IDs is created in memory and is initially empty. From among the plurality of node ID lists, a particular node ID is selected based on the one or more order criteria, removed from the node ID list where the particular node ID originates, and added to the new list. This process of selecting, removing, and adding continues until no more than one node ID list exists, other than the new list. In this way, the retrieval of the plurality of node ID lists from storage may be performed in parallel while the selecting and adding are performed sequentially.

    Abstract translation: 提供了有效地将图形数据加载到存储器中的技术。 从存储器检索多个节点ID列表。 每个节点ID列表根据一个或多个订单标准（如节点ID）进行排序，并被读入存储器。 节点ID的新列表在内存中创建，最初为空。 从多个节点ID列表中，基于从特定节点ID发起的节点ID列表中移除并添加到新列表的一个或多个顺序标准来选择特定节点ID。 除了新的列表之外，这个选择，删除和添加的过程将继续存在，直到不再有一个节点ID列表存在。 以这种方式，可以在顺序执行选择和添加的同时并行执行从存储器检索多个节点ID列表。

Patent Agency Ranking