知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

15 records (took 0.015 seconds)

    OPTIMIZING GRAPH QUERIES BY PERFORMING EARLY PRUNING
    2.
    发明申请
    OPTIMIZING GRAPH QUERIES BY PERFORMING EARLY PRUNING 有权

    公开(公告)号：US20210216590A1

    公开(公告)日：2021-07-15

    申请号：US16738972

    申请日：2020-01-09

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： ARNAUD DELAMARE ,  VASILEIOS TRIGONAKIS ,  JEAN-PIERRE LOZI ,  VLAD IOAN HAPRIAN ,  PETR KOUPY ,  HASSAN CHAFI ,  SUNGPACK HONG

    IPC: G06F16/901 ,  G06F16/9032 ,  G06F16/903 ,  G06F16/2453

    Abstract: Techniques are described herein for early pruning of potential graph query results. Specifically, based on determining that property values of a path through graph data cannot affect results of a query, the path is pruned from a set of potential query solutions prior to fully exploring the path. Early solution pruning is performed on prunable queries that project prunable functions including MIN, MAX, SUM, and DISTINCT, the results of which are not tied to a number of paths explored for query execution. A database system implements early solution pruning for a prunable query based on intermediate results maintained for the query during query execution. Specifically, when a system determines that property values of a given potential solution path cannot affect the query results reflected in intermediate results maintained for the query, the path is discarded from the set of possible query solutions without further exploration of the path.

    DATABASE MODULARIZATION OF PLUGGABLE GUEST LANGUAGES
    4.
    发明申请
    DATABASE MODULARIZATION OF PLUGGABLE GUEST LANGUAGES 有权

    公开(公告)号：US20210064588A1

    公开(公告)日：2021-03-04

    申请号：US16556847

    申请日：2019-08-30

    Applicant: Oracle International Corporation

    Inventor： PIT FENDER ,  HARSHAD KASTURE ,  ALEXANDER ULRICH ,  BENJAMIN SCHLEGEL ,  MATTHIAS BRANTNER ,  HASSAN CHAFI

    IPC: G06F16/21

    Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

    DATABASE ENVIRONMENTS FOR GUEST LANGUAGES
    8.
    发明申请
    DATABASE ENVIRONMENTS FOR GUEST LANGUAGES 有权

    公开(公告)号：US20210064614A1

    公开(公告)日：2021-03-04

    申请号：US16556815

    申请日：2019-08-30

    Applicant: Oracle International Corporation

    Inventor： PIT FENDER ,  HARSHAD KASTURE ,  ALEXANDER ULRICH ,  BENJAMIN SCHLEGEL ,  MATTHIAS BRANTNER ,  HASSAN CHAFI

    IPC: G06F16/242 ,  G06F16/25 ,  G06F9/455

    Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

    GRAPH DATA PROCESSING SYSTEM THAT SUPPORTS AUTOMATIC DATA MODEL CONVERSION FROM RESOURCE DESCRIPTION FRAMEWORK TO PROPERTY GRAPH
    9.
    发明申请
    GRAPH DATA PROCESSING SYSTEM THAT SUPPORTS AUTOMATIC DATA MODEL CONVERSION FROM RESOURCE DESCRIPTION FRAMEWORK TO PROPERTY GRAPH 审中-公开
    图形数据处理系统支持从资源描述框架到属性图表的自动数据模型转换

    公开(公告)号：US20170032052A1

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

    申请号：US14812819

    申请日：2015-07-29

    Applicant: Oracle International Corporation

    Inventor： RAGHAVAN RAMAN ,  SUNGPACK HONG ,  HASSAN CHAFI

    IPC: G06F17/30

    CPC classification number: G06F16/9024

    Abstract: A graph processing system that supports automatic data model conversion from Resource Framework Description (RDF) to Property Graph (PG) is provided. Rather than using a naive conversion approach that creates PG nodes and edges without properties, a set of conversion rules is evaluated to automatically convert RDF triples into PG nodes and edges with properties, as appropriate. Accordingly, the converted PG data takes full advantage of the PG format while advantageously avoiding the creation of extraneous nodes and edges, allowing queries on the PG data to be efficiently executed on any database supporting the PG data model. The plurality of rules categorize each triple into three different cases depending on whether or not the predicate is “rdf:type” and whether or not the object is a literal value, generating graph entities as appropriate for each case. Optionally, user defined rules may override the automatic rules.

    Abstract translation: 提供了支持从资源框架描述（RDF）到属性图（PG）的自动数据模型转换的图形处理系统。 而不是使用创建没有属性的PG节点和边缘的天真的转换方法，而是根据需要评估一组转换规则，以便将RDF三元组自动转换为具有属性的PG节点和边。 因此，转换的PG数据充分利用PG格式，同时有利地避免了外部节点和边缘的创建，允许在支持PG数据模型的任何数据库上有效地执行对PG数据的查询。 多个规则根据谓词是否为“rdf：type”，以及对象是否是文字值，将每个三元组分为三种不同的情况，根据情况生成图形实体。 可选地，用户定义的规则可以覆盖自动规则。

    SCOUTING QUERIES FOR IMPROVING QUERY PLANNING IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES
    10.
    发明公开
    SCOUTING QUERIES FOR IMPROVING QUERY PLANNING IN DISTRIBUTED ASYNCHRONOUS GRAPH QUERIES 审中-公开

    公开(公告)号：US20240184780A1

    公开(公告)日：2024-06-06

    申请号：US18073629

    申请日：2022-12-02

    Applicant: Oracle International Corporation

    Inventor： TOMÁ FALTÍN ,  VASILEIOS TRIGONAKIS ,  SUNGPACK HONG ,  HASSAN CHAFI

    IPC: G06F16/2453 ,  G06F16/901

    CPC classification number: G06F16/24542 ,  G06F16/9024

    Abstract: A graph processing system is provided for executing scouting queries for improving query planning. A query planner creates a plurality of scouting queries, each scouting query in the plurality of scouting queries corresponding to a query plan for a graph query and having an associated confidence value. A graph processing system performs limited execution of the plurality of scouting queries and determines a metric value for each scouting query in the plurality of scouting queries based on execution of the scouting query. The system determines a score for each scouting query in the plurality of scouting queries based on its metric value and the confidence value of the corresponding query plan and selects a query plan based on the scores of the plurality of scouting queries. The system executes the graph query based on the selected query plan.

Patent Agency Ranking