中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

18 records (took 0.019 seconds)

    THROTTLING GROUP IN ORACLE SERVICE BUS
    2.
    发明申请
    THROTTLING GROUP IN ORACLE SERVICE BUS 有权
    ORACLE服务总线中的折衷组

    公开(公告)号：US20140280819A1

    公开(公告)日：2014-09-18

    申请号：US13801972

    申请日：2013-03-13

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： Rahul Gupta ,  Dimitri Laloue ,  Kiran Prabhakar

    IPC: H04L29/08

    CPC classification number: H04L67/1031 ,  G06F9/5083 ,  G06F2209/504 ,  H04L67/1008 ,  Y02D10/22

    Abstract: A computer-controlled method can include creating a throttling group corresponding to a backend server configured to provide business services to multiple electronic devices over a service bus, defining a throttling group parameter for the throttling group, and routing messages based on the throttling group parameter.

    Abstract translation: 计算机控制的方法可以包括创建对应于后端服务器的限制组，所述后端服务器被配置为通过服务总线向多个电子设备提供业务服务，为限制组定义节流组参数，以及基于所述调节组参数来路由消息。

    DISCOVERY OF SOURCE RANGE PARTITIONING INFORMATION IN DATA EXTRACT JOB
    3.
    发明公开
    DISCOVERY OF SOURCE RANGE PARTITIONING INFORMATION IN DATA EXTRACT JOB 审中-公开

    公开(公告)号：US20240202210A1

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

    申请号：US18084421

    申请日：2022-12-19

    Applicant: Oracle International Corporation

    Inventor： Rohit Jaykumar Gattani ,  Rahul Gupta ,  Arun Patnaik ,  Vinod Murli Mamtani

    IPC: G06F16/27

    CPC classification number: G06F16/27

    Abstract: Techniques are described for the discovery of source range partitioning information. An example method includes a device determining a partition boundary value for the data based at least in part on the following steps. The device can determine a first plurality of bounded value sets and a second plurality of bounded value sets. The device can calculate a first average value of a first value and a second average value. The device can determine a first deviation value of the first average value from the first value and a second deviation value of the second average value from a third value. The device can determine the first partition boundary value based at least in part on the first deviation value and the second deviation value, the first partition boundary value being the first candidate partition boundary value or the second candidate partition boundary value.

    Techniques for metadata value-based mapping during data load in data integration job
    4.
    发明授权
    Techniques for metadata value-based mapping during data load in data integration job 有权

    公开(公告)号：US11899680B2

    公开(公告)日：2024-02-13

    申请号：US17690495

    申请日：2022-03-09

    Applicant: Oracle International Corporation

    Inventor： Rohit Jaykumar Gattani ,  Rahul Gupta ,  Arun Patnaik

    IPC: G06F17/00 ,  G06F16/25

    CPC classification number: G06F16/254

    Abstract: The present embodiments relate to metadata value-based mapping during a data load in a data integration job. A computing device can receive a first data set from a source system and computer-readable instructions to load data into a target system. The device can receive a first metadata set from the target system that describe destinations. The computing device can identify a first data value of the first data set that matches a metadata value of the first metadata set. The device can receive a data integration mapping of the second data value of the first data set to a data field associated with the matching metadata value of the first metadata set. The device can load the second data value of the first data set from the source system into the target system pursuant to the mapping and the computer-readable instructions.

    TECHNIQUES FOR METADATA VALUE-BASED MAPPING DURING DATA LOAD IN DATA INTEGRATION JOB
    6.
    发明公开
    TECHNIQUES FOR METADATA VALUE-BASED MAPPING DURING DATA LOAD IN DATA INTEGRATION JOB 审中-公开

    公开(公告)号：US20230289360A1

    公开(公告)日：2023-09-14

    申请号：US17690495

    申请日：2022-03-09

    Applicant: Oracle International Corporation

    Inventor： Rohit Jaykumar Gattani ,  Rahul Gupta ,  Arun Patnaik

    IPC: G06F16/25

    CPC classification number: G06F16/254

    Abstract: The present embodiments relate to metadata value-based mapping during a data load in a data integration job. A computing device can receive a first data set from a source system and computer-readable instructions to load data into a target system. The device can receive a first metadata set from the target system that describe destinations. The computing device can identify a first data value of the first data set that matches a metadata value of the first metadata set. The device can receive a data integration mapping of the second data value of the first data set to a data field associated with the matching metadata value of the first metadata set. The device can load the second data value of the first data set from the source system into the target system pursuant to the mapping and the computer-readable instructions.

    GEO-HASHING FOR PROXIMITY COMPUTATION IN A STREAM OF A DISTRIBUTED SYSTEM
    7.
    发明申请
    GEO-HASHING FOR PROXIMITY COMPUTATION IN A STREAM OF A DISTRIBUTED SYSTEM 审中-公开

    公开(公告)号：US20190102387A1

    公开(公告)日：2019-04-04

    申请号：US16123973

    申请日：2018-09-06

    Applicant: Oracle International Corporation

    Inventor： Santosh Kumar ,  Santosh Kumar Singh ,  Prithviraj Singh ,  Rahul Gupta ,  Yathish Gatty ,  Hanumesh Thippanna Govindappa

    IPC: G06F17/30

    Abstract: An event processing system for distributing a geospatial computation, and processing events in an event stream, is disclosed. The disclosed system and methods can apply a spatial function, such as distance, within Distance, and proximity, in parallel to a stream comprising event locations. The disclosed system improves over existing geospatial computations by providing an efficient parallel implementation that can handle a large number of moving objects in real time with little latency. A computing device receives an event stream comprising locations and can geohash the locations to obtain geohashes identifying geo grid cells containing the locations. The computing device can determine respective sets of neighboring geohashes identifying neighboring cells in the geo grid. The computing device then partitions the geospatial computation by mapping, based on the respective geo hash and the respective set of neighboring geo hashes, the events to processors.

    Scaling out moving objects for geo-fence proximity determination
    8.
    发明授权
    Scaling out moving objects for geo-fence proximity determination 有权

    公开(公告)号：US10231085B1

    公开(公告)日：2019-03-12

    申请号：US16124014

    申请日：2018-09-06

    Applicant: Oracle International Corporation

    Inventor： Santosh Kumar ,  Santosh Kumar Singh ,  Prithviraj Singh ,  Rahul Gupta ,  Yathish Gatty ,  Kunal Mulay

    IPC: H04W24/00 ,  H04W4/021 ,  H04W4/02 ,  H04L29/08 ,  G06F17/30 ,  G06F9/54

    Abstract: An event processing system for distributing geospatial computations with geo-fences is disclosed. The system can partition and distribute geo-fences efficiently for parallel computation, and can track a potentially unlimited number of moving objects. A computing device determines a minimum bounding rectangle (MBR) covering a geographic area indexed by a geo-grid, and partitions the MBR and a set of geo-fences to a plurality of processing nodes. The computing device receives input events of a stream comprising locations within the geographic area. The device distributes the events to partitions on processing nodes, based at least on the events' locations. The device can determine a partition identifier corresponding to a respective location in constant time. The computing device then combines partition results to obtain a single geospatial computation result.

    DISCOVERY OF DISCRETE PARTITIONING INFORMATION
    10.
    发明申请
    DISCOVERY OF DISCRETE PARTITIONING INFORMATION 有权

    公开(公告)号：US20250036652A1

    公开(公告)日：2025-01-30

    申请号：US18225827

    申请日：2023-07-25

    Applicant: Oracle International Corporation

    Inventor： Rohit Jaykumar Gattani ,  Rahul Gupta

    IPC: G06F16/27 ,  G06F16/25

    Abstract: Techniques are described herein are directed toward a method for discovery of discrete partitioning information. A system can receive data sets in table format from source system. The data can be stored in the source system to be partitioned and transmitted from the source system to a target system. The system can determine a respective partitioning column for each data set. The system can determine a number of partitions. The system can determine, for each data set, a respective set of discrete values from the plurality of discrete values of the respective partitioning column. The number of the discrete values of the set of discrete values can be based at least in part on the number of partitions. The system can the discrete value sets with each other. The system can determine a final set of discrete values based at least in part on the comparison.

Patent Agency Ranking