Patent application number | Description | Published |
20080281846 | High performant row-level data manipulation using a data layer interface - Performing an operation directly on data stored in a database table provides for avoiding generation and processing of SQL statements. A Data Layer interface, comprising a set of APIs, allows internal database server components to call directly to the Data Layer for making fast row changes to a table. According to an embodiment, before making any row change to a table through this Data Layer interface, a shared state data structure is created to hold the metadata about the table. A single shared state can be used for all DML changes to a particular table regardless of what columns are updated or inserted during each DML operation. When a process needs to change a row, the process uses a mutable state based on the shared state of the table. | 11-13-2008 |
20090037422 | COMBINING CAPTURE AND APPLY IN A DISTRIBUTED INFORMATION SHARING SYSTEM - In accordance with an embodiment of the present invention, an information sharing mechanism comprising a memory structure may be provided in a database system. In an embodiment, mined information transferred by a capture process to an associated apply process can be written into the memory structure without taking any latch. Similarly, the mined information can be read by the apply process from the memory structure without taking any latch. The capture and apply processes may work cooperatively to establish a safe point in log mining under various circumstances such as in an initial startup state, in a steady state, in a process restart scenario in the middle of information sharing. In some embodiments, the information sharing mechanism supports both checkpoint-free and checkpoint modes of log mining by the capture process. In addition, both the capture process and the apply process may employ an eager apply approach to increase processing capacity. | 02-05-2009 |
20090037494 | CHECKPOINT-FREE IN LOG MINING FOR DISTRIBUTED INFORMATION SHARING - A checkpoint free log mining mechanism comprising a capture process and an apply process that are logically associated with each other may be provided in a database system. In an embodiment, log mining information published by the capture process to the apply process comprises a complete set of log information for each interesting transaction. A system change number of a start transaction record of a transaction may be used to represent a start time of the entire transaction. The capture and apply processes may work cooperatively to establish a safe time point in the form of a particular system change number in logs to begin mining, under various circumstances such as in an initial startup state, in a steady state, in a process restart scenario in the middle of checkpoint free log mining, or in a transition between the checkpoint mode and the checkpoint free mode. | 02-05-2009 |
20100036810 | AUTOMATED TOPOLOGY-BASED STATISTICS MONITORING AND PERFORMANCE ANALYSIS - A computer is programmed to parse a network that interconnects databases in a distributed database system, into a number of paths, wherein each path starts in a source database that is a source of changes and ends in a destination database that uses the changes to replicate the source database. The computer identifies databases that occur within each path in the network, and queries the identified databases to obtain statistics for each path. Statistics along each path are analyzed automatically, to identify a component in each path as a candidate for further investigation. The identified component may be marked as a bottleneck e.g. if there are no other paths connected to it. Alternatively the identified component may be a source of changes for another path that has a bottleneck or that has another candidate for further investigation. The identified bottleneck is displayed to the user with recommendations for improvement. | 02-11-2010 |
20110010392 | Checkpoint-Free In Log Mining For Distributed Information Sharing - Techniques for replicating data between database systems without taking checkpoints are provided. In an embodiment, a capture process restarts. Upon restarting, the capture process reestablishes an association with an apply process. A particular logical time maintained by the apply process is then communicated to the capture process. Upon receiving the particular logical time, the capture process restarts mining from this particular logical time. | 01-13-2011 |
20120109889 | Automated Topology-Based Statistics Monitoring And Performance Analysis - A computer is programmed to parse a network that interconnects databases in a distributed database system, into a number of paths, wherein each path starts in a source database that is a source of changes and ends in a destination database that uses the changes to replicate the source database. The computer identifies databases that occur within each path in the network, and queries the identified databases to obtain statistics for each path. Statistics along each path are analyzed automatically, to identify a component in each path as a candidate for further investigation. The identified component may be marked as a bottleneck e.g. if there are no other paths connected to it. Alternatively the identified component may be a source of changes for another path that has a bottleneck or that has another candidate for further investigation. The identified bottleneck is displayed to the user with recommendations for improvement. | 05-03-2012 |
20140040203 | STATEMENT-LEVEL AND PROCEDURAL-LEVEL REPLICATION - Techniques for replicating data in database systems are described. In an example embodiment, a set of changes is received at a destination database, where the set of changes has been applied at a source database and is being replicated from the source database to the destination database. The set of changes is analyzed and it is determined that the set of changes includes two or more of: a subset of row-level changes, a subset of statement-level changes, and a subset of procedure-level changes. A set of dependencies is determined at least between the changes that are included in the subsets of changes. The changes, in the subsets of changes, are assigned to two or more processing elements. The set of changes is applied to the destination database by executing the two or more processing elements in parallel to each other and based on the set of dependencies. | 02-06-2014 |
20140297235 | PRODUCTION ANALYSIS AND/OR FORECASTING METHODS, APPARATUS, AND SYSTEMS - Methods and apparatus for modeling well production. Such methods comprise modeling a production of a well (perhaps an open universe, generative model). Methods also comprise determining probability distributions for physical parameters associated with the well by training the model with historic well production data (perhaps using sparse sampling). Such methods also comprise determining a posterior distribution for the model by sampling probability distributions for the parameters. Some methods further comprise determining a posterior distribution for the well's production using the model's posterior distribution. Non-Gaussian (Laplacian) noise can be added to the model. Methods can comprise financially modeling the well. Some methods comprise using MCMC sampling to converge the parameter posterior distribution for the well's production. An EUR for the well can be determined as well as an uncertainty associated with the posterior distribution for the production. If desired, some methods comprise modeling multi-phase flow in the well. | 10-02-2014 |
20140310071 | PHYSICALLY-BASED FINANCIAL ANALYSIS AND/OR FORECASTING METHODS, APPARATUS, AND SYSTEMS - Methods and apparatus for modeling well production. Such methods comprise modeling a production of a well (perhaps an open universe, generative model). Methods also comprise determining probability distributions for physical parameters associated with the well by training the model with historic well production data (perhaps using sparse sampling). Such methods also comprise determining a posterior distribution for the model by sampling probability distributions for the parameters. Some methods further comprise determining a posterior distribution for the well's production using the model's posterior distribution. Non-Gaussian (Laplacian) noise can be added to the model. Methods can comprise financially modeling the well. Some methods comprise using MCMC sampling to converge the parameter posterior distribution for the well's production. An EUR for the well can be determined along with an uncertainty associated with the posterior distribution for the production. If desired, some methods comprise modeling multi-phase flow in the well. | 10-16-2014 |
20150032694 | Scalable Coordination Aware Static Partitioning For Database Replication - Parallel logical replication involves multiple apply threads running on a destination database server applying, in parallel, changes made by source transactions, where the changes of a single source transaction may be applied in parallel by multiple apply threads. An apply transaction for a source transaction may be committed by an apply thread independently of the commitment of any other apply transaction of the source transaction, that is, without coordinating the committing of another apply transaction executed by another apply thread for the source transaction. A configuration language is used to configure parallel logical replication. The language facilitates the configuration of various aspects of parallel logical replication, including the number of apply threads, partitioning schemes for the apply threads for partitioning change records between the apply threads, and various other aspects of parallel logical replication. | 01-29-2015 |