中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

22 records (took 0.016 seconds)

    CONSISTENT CLIENT-SIDE CACHING FOR FINE GRAINED INVALIDATIONS
    11.
    发明申请
    CONSISTENT CLIENT-SIDE CACHING FOR FINE GRAINED INVALIDATIONS 审中-公开

    公开(公告)号：US20190325052A1

    公开(公告)日：2019-10-24

    申请号：US15958517

    申请日：2018-04-20

    Applicant: Oracle International Corporation

    Inventor： Mehul Bastawala ,  Atrayee Mullick ,  George Eadon ,  Ramesh Kumar

    IPC: G06F17/30 ,  G06F12/0891

    Abstract: An approach for implementing function semantic based partition-wise SQL execution and partition pruning in a data processing system is provided. The system receives a query directed to a range-partitioned table and determines if operation key(s) of the query include function(s) over the table partitioning key(s). If so, the system obtains a set of values corresponding to each partition by evaluating the function(s) on a low bound and/or a high bound table partitioning key value corresponding to the partition. The system may then compare the sets of values corresponding to different partitions and determine whether to aggregate results obtained by executing the query over the partitions based on the comparison. The system may also determine whether to prune any partitions from processing based on a set of correlations between the set of values for each partition and predicate(s) of the query including function(s) over the table partitioning key(s).

    Partial indexes for partitioned tables
    12.
    发明授权
    Partial indexes for partitioned tables 有权

    公开(公告)号：US10282437B2

    公开(公告)日：2019-05-07

    申请号：US14255425

    申请日：2014-04-17

    Applicant: Oracle International Corporation

    Inventor： Ananth Raghavan ,  George Eadon ,  Ramesh Kumar ,  Hermann Baer ,  Suresh Sridharan

    IPC: G06F17/30

    Abstract: Techniques for creating and using partial indexes are provided. A partial index is an index that indexes one or more partitions of a partitioned table and does not index one or more other partitions of the partitioned table. Thus, if a partition of a partitioned table is rarely used, then an index may index all other partitions of the partitioned table or at least only those partitions that are written to or read from relatively frequently. Also, in preparation for loading data into a partition, indexing for the partition may be “turned off”, effectively making a full index a partial index. While the data is loaded into the partition, the partial index is still available for query processing. After the data is loaded into the partition, indexing for the partition is “turned on”, which causes the data in the partition to be indexed by the partial index.

    MOVING DATA BETWEEN PARTITIONS
    13.
    发明申请
    MOVING DATA BETWEEN PARTITIONS 有权
    移动分组之间的数据

    公开(公告)号：US20150347401A1

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

    申请号：US14289926

    申请日：2014-05-29

    Applicant: Oracle International Corporation

    Inventor： Ananth Raghavan ,  George Eadon ,  Ramesh Kumar ,  Hermann Baer ,  Suresh Sridharan

    IPC: G06F17/30

    CPC classification number: G06F17/303

    Abstract: Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition.

    Abstract translation: 提供了在分区之间移动数据的技术。 可以执行这样的过程，而不需要阻止目标分区的事务被执行的任何锁。 相反，这样的事务可以在执行移动操作时进行。 移动操作涉及将数据从目标分区复制到另一个从（或“不可见”）隐藏到分区尝试读取或写入的那些事务的分区。 在移动操作期间，对分区进行的更改也会反映在日志中。 最终，日志中反映的变化被排除并应用于隐藏的分区。 一旦分区和隐藏的分区被同步，分区的标识被交换，以便将来的事务将针对先前隐藏的分区，而不是以前可视的分区。

    Dropping an index without blocking locks
    14.
    发明授权
    Dropping an index without blocking locks 有权

    公开(公告)号：US11360802B2

    公开(公告)日：2022-06-14

    申请号：US16887980

    申请日：2020-05-29

    Applicant: Oracle International Corporation

    Inventor： Ramesh Kumar ,  Ananth Raghavan ,  George Eadon

    IPC: G06F16/22 ,  G06F9/46 ,  G06F16/23

    Abstract: Techniques for processing “destructive” database statements are provided. Destructive database statements, when processed, cause metadata of a database object to be changed. Examples of such database statements include ones that delete an index, that set a column as unused, and that drop a constraint on a column. When such a statement is received, a change is made to metadata of a database object. Such a metadata change may involve setting an index as unusable, disabling a constraint, or invalidating a cursor. After the metadata change, a first time is determined. Then, it is determined when one or more database transactions that were pending at the first time have committed. After those database transaction(s) have committed, one or more operations are performed, such as dropping an index or dropping a constraint.

    MOVING DATA BETWEEN PARTITIONS
    15.
    发明申请
    MOVING DATA BETWEEN PARTITIONS 有权

    公开(公告)号：US20210103569A1

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

    申请号：US17125777

    申请日：2020-12-17

    Applicant: Oracle International Corporation

    Inventor： Ananth Raghavan ,  George Eadon ,  Ramesh Kumar ,  Hermann Baer ,  Suresh Sridharan

    IPC: G06F16/21

    Abstract: Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition.

    Hybrid approach for equivalence reasoning
    16.
    发明授权
    Hybrid approach for equivalence reasoning 有权

    公开(公告)号：US10437873B2

    公开(公告)日：2019-10-08

    申请号：US14047318

    申请日：2013-10-07

    Applicant: ORACLE INTERNATIONAL CORPORATION

    Inventor： Vladimir Kolovski ,  Zhe Wu ,  George Eadon

    IPC: G06F16/36 ,  G06N5/04

    Abstract: Systems, methods, and other embodiments associated with equivalence reasoning are described. One example method includes iteratively inputting batches of unprocessed equivalence pairs from a semantic model to an operating memory. In the operating memory, one or more cliques for the input batches are built until no further batches remain. A clique designates a canonical representative resource for a group of equivalent resources as determined from the equivalence pairs. The one or more cliques are built for the input batches to a clique map in a remote access memory. The clique map is returned for use by the semantic model.

    Non-blocking database table alteration
    17.
    发明授权
    Non-blocking database table alteration 有权

    公开(公告)号：US10417257B2

    公开(公告)日：2019-09-17

    申请号：US15267540

    申请日：2016-09-16

    Applicant: Oracle International Corporation

    Inventor： Ramesh Kumar ,  Ananth Raghavan ,  George Eadon

    IPC: G06F16/27 ,  G06F16/21

    Abstract: Systems for managing large database systems. Storage devices hold a set of one or more subject database tables that hold subject data accessed by one or more users. A data definition statement to perform a table alteration operation (e.g., a table partition operation) over a particular table in the subject database is received, parsed, and the table alteration operation over the particular table is initiated. During the processing of the data definition statement to complete the table alteration operation, a data manipulation statement to perform a table access operation over the same table is received and parsed. The data manipulation statement is not blocked, even while the table alteration operations are ongoing. Rather, during the time that the table alteration operations are ongoing, the data manipulation statement is processed using hidden tables. After the table alteration operations have completed, incoming data manipulation statements are performed over the altered database tables.

    Autonomously partitioning database tables
    19.
    发明授权
    Autonomously partitioning database tables 有权

    公开(公告)号：US11531704B2

    公开(公告)日：2022-12-20

    申请号：US16948303

    申请日：2020-09-11

    Applicant: Oracle International Corporation

    Inventor： George Eadon ,  Ramesh Kumar ,  Ananth Raghavan

    IPC: G06F16/901 ,  G06F16/903

    Abstract: What is disclosed is an improved approach to perform automatic partitioning, without requiring any expertise on the part of the user. A three stage processing pipeline is provided to generate candidate partition schemes, to evaluate the candidate using real table structures that are empty, and to then implement a selected scheme with production data for evaluation. In addition, an improved approach is described to perform automatic interval partitioning, where the inventive concept implements interval partitioning that does not impose these implicit constraints on the partition key column.

Patent Agency Ranking