Patent application number | Description | Published |
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 |
20090037442 | Reconfiguring Propagation Streams in Distributed Information Sharing - Splitting and merging database object information sharing streams. Streams are also referred to herein as “propagations”. Splitting and merging information sharing streams can be used to improve performance in a information sharing environment when a failed or slow DBS impacts the performance. In one embodiment, an auto split process monitors the progress of applying changes at each node and detects the presence of a failed or a slow node. Once the failed or slow node is identified, the auto split process splits the propagation such that the offending node is sent through a separate propagation. Furthermore, an auto merge process can be started to monitor the newly created separate propagation. At a later point, the new propagation can be merged back into the original stream. For example, if the offending node catches up with other nodes, the auto merge process merges the newly created propagation back to the original propagation. | 02-05-2009 |
20090037553 | Configuring or Reconfiguring a Multi-Master Information Sharing Environment - Configuring an n-way multi-master information sharing topology. Adding a new node (e.g., database server) to the information sharing topology can be implemented as follows. Initially, the new node is added as a slave of a particular co-master in the information sharing topology. The objects to replicate are instantiated on the new node by propagating data from the particular co-master to the new node. Furthermore, a capture process is created on the particular co-master to send changes to the objects to the slave. Meanwhile, the co-masters continue to propagate changes to each other. To promote the slave to a master, changes to objects stored at the slave are propagated to each of the co-masters. Furthermore, changes at each of the masters are propagated to the promoted node. | 02-05-2009 |
20100169350 | HIGH-PERFORMANCE, SCALABLE, ADAPTIVE AND MULTI-DIMENSIONAL EVENT REPOSITORY - A High-Performance, Scalable, Adaptive and Multi-dimensional Event Repository is described and utilized in a method for publishing an event in a database. The present method includes transparently intercepting a request to a database to publish an event. A messaging system operable with the database intercepts the request. The present method further includes examining an event repository for a template of the event. The event repository is operable with the database and the messaging system. The present method additionally includes retrieving the event template from the event repository. The present method also includes marshalling the event template to create the event. The present method also includes publishing the event in an event queue. | 07-01-2010 |
20110029585 | AUTOMATIC AND DYNAMIC PROVISIONING OF DATABASES - Approaches described herein may be used for provisioning of databases that requires a bulk transfer of data within a distributed computing environment, such as a grid. The approaches do not require the manual intervention of a DBA to, for example, transfer a tablespace between the file systems of operating systems. Instead, the tablespaces may be provisioned automatically and dynamically by a grid computing system whenever it determines the need to dynamically provision a database. In addition, as copies of tablespaces are provisioned, synchronization mechanisms can also be automatically provisioned to keep the tablespaces and their copies in sync. | 02-03-2011 |
20110302136 | RECOVERABLE EXECUTION - Systems and methods for providing a one-step API that executes a series of atomic transactions in a database system. In one implementation, each atomic transaction is associated with a forward block of code that effects changes, an undo block of code that reverses the changes made by the forward block, and a state block of code that mimics successful execution of the forward block by setting internal states. In the event of a failure, the forward blocks, undo blocks, and state blocks can be used to roll forward or roll back changes as a whole. In one implementation, a one-step API for replicating data in a database is provided. | 12-08-2011 |
20140032517 | SYSTEM AND METHODS TO CONFIGURE A PROFILE TO RANK SEARCH RESULTS - A method and system to configure a profile to rank search results are provided. A profile that includes behavior information organized as a plurality of components is generated. Additional behavior information is received from a user. At least one component of the plurality of components is updated using the additional behavior information received from the user. A search query is received and search results are generated based on the search query. Search results are ranked based on the updated profile. | 01-30-2014 |
20140032532 | SPELL CHECK USING COLUMN CURSOR - An input query can be spell checked by first parsing the input query into one or more tokens. The one or more tokens are then compared against spell storage tables to derive alternative tokens. A spell cursor is launched, with the spell cursor calculating scores for permutations of the tokens and alternative tokens, and the scores representing a likelihood that a user intended to use the permutation as the input query. A memory table may then be formed including the permutations and scores. The memory table can then be passed to a column cursor, the column cursor designed to form an output table of results based on queries to a database using the permutations. | 01-30-2014 |
20140032593 | SYSTEMS AND METHODS TO PROCESS A QUERY WITH A UNIFIED STORAGE INTERFACE - Systems and methods to process a query with a unified storage interface are described. The system receives a query from a client machine and generates a query expression tree based on the query expression. The system generates a cursor expression tree based on the query expression tree. The system executes a plurality of software components in the cursor expression tree to retrieve data from a first storage device. The plurality of software components comprise a first software component that is utilized to retrieve data irrespective of a plurality of storage devices and a second software component that is utilized to retrieve data from a first storage device. Finally, the system communicates search results to the client machine, the search results include at least a portion of the data. | 01-30-2014 |
20140129515 | HIGH-PERFORMANCE, SCALABLE, ADAPTIVE AND MULTI-DIMENSIONAL EVENT REPOSITORY - A High-Performance, Scalable, Adaptive and Multi-dimensional Event Repository is described and utilized in a method for publishing an event in a database. The present method includes transparently intercepting a request to a database to publish an event. A messaging system operable with the database intercepts the request. The present method further includes examining an event repository for a template of the event. The event repository is operable with the database and the messaging system. The present method additionally includes retrieving the event template from the event repository. The present method also includes marshaling the event template to create the event. The present method also includes publishing the event in an event queue. | 05-08-2014 |
20140222856 | SYSTEM AND METHODS TO CONFIGURE A QUERY LANGUAGE USING AN OPERATOR DICTIONARY - A method and a system to configure a query language using an operator dictionary are provided. Dictionary information that corresponds to a first user is generated. The dictionary information includes a first list of compatible query operators and a description of compatible data types that correspond to each operator in the first list of query operators. A search query to search for document information in a database is received from a first user. The database includes an inverted index. Terms of the search query from the first user are determined to be in accordance with the dictionary information that corresponds to the first user. The search query is applied to the inverted index in the database to identify the document information. The document information is sent to the first user. | 08-07-2014 |