| GRAVIC, INC. Patent applications |
| Patent application number | Title | Published |
|---|
| 20120101990 | METHOD FOR ENSURING REPLICATION FROM A CHANGE QUEUE OF A SOURCE DATABASE TO A TARGET DATABASE WHEN TRANSACTION LOAD EXCEEDS DATA PATH BY SPAWNING A NEW TRANSACTION PATH BETWEEN THE CHANGE QUEUE AND THE TARGET DATABASE - A method is provided for replicating transaction data from a source database to a target database wherein the transaction data is communicated from a change queue associated with the source database to the target database. An initial path is provided between the change queue and the target database for transaction data to flow. The initial path has a maximum transaction load capacity. It is then detected whether the current transaction load is close or equal to the maximum transaction load capacity of the initial path. If so, another path is provided between the change queue and the target database. | 04-26-2012 |
| 20120093439 | DYNAMIC RESPONSE FORM SYMBOLOGY PROCESSING - A method is provided for using at least one response bubble on a response form to indicate one or more responses. The response form has a key definition area that includes one or more response bubbles corresponding to one or more intended responses, and a response area that includes one or more response bubbles for indicating intended responses. A response form is completed by defining an unambiguous symbology of one or more marks by completing the key definition area, and filling in the response area using the defined unambiguous symbology. The response form is then electronically imaged. The unambiguous symbology is then automatically interpreted from the key definition area of the response form. The indicated intended responses of the one or more response bubbles of the completed response form are automatically interpreted using the interpreted unambiguous symbology, and the electronically imaged completed response form. | 04-19-2012 |
| 20110176736 | DYNAMIC RESPONSE BUBBLE ATTRIBUTE COMPENSATION - Image data of a response form is processed. The response form has a plurality of response bubbles, including at least one filled and at least one unfilled response bubble. One or more baseline response bubble attributes for unfilled response bubbles are provided in a memory. Image data of a response form is processed to determine one or more response bubbles that are unfilled. One or more actual response bubble attributes of the one or more unfilled response bubbles is then calculated. A difference metric value is then calculated by comparing the one or more baseline response bubble attributes to the one or more actual response bubble attributes. The one or more baseline response bubble attributes are reset to a new set of one or more baseline response bubble attributes if the difference metric value exceeds a predetermined threshold. The one or more baseline response bubble attributes are maintained at their present value if the difference metric value does not exceed the predetermined threshold. The image data of the response form is then processed using either the reset or maintained one or more baseline response bubble attributes to determine the filled and unfilled response bubbles of the response form. | 07-21-2011 |
| 20100332449 | METHOD FOR ENSURING REPLICATION WHEN SYSTEM RESOURCES ARE LIMITED - A method is provided for replicating transaction data from a source database to a target database wherein the transaction data is communicated from a change queue associated with the source database to the target database. An initial path is provided between the change queue and the target database for transaction data to flow. The initial path has a maximum transaction load capacity. It is then detected whether the current transaction load is close or equal to the maximum transaction load capacity of the initial path. If so, another path is provided between the change queue and the target database. Also, a method is provided of replicating transaction data from a source database to a target database wherein an associated with the target database has a maximum transaction threshold limit. The applier normally posts transaction data to the target database only upon receipt of a commit step or operation associated with respective transaction data. First, it is detected as to whether the maximum transaction threshold limit of the applier has been reached. If so, a commit step or operation is prematurely conducted on at least some of the transaction data in the applier, thereby causing the transaction data to become posted to the target database and deleted from the applier. | 12-30-2010 |
| 20100332448 | METHOD FOR ENSURING REFERENTIAL INTEGRITY IN REPLICATION ENGINES BY RESOLVING LOCK CONFLICTS - A method is provided for processing base level data of a change queue that is not serialized at the logical level. The base level change queue data is transaction data previously posted to a source database. A logical replication engine is provided to replicate and post the change queue data to a target database in the order that the transaction data is stored in the change queue. Upon detection in the logical replication engine of change queue data that is not serialized at the logical level, the change queue data is reserialized at the logical level before the logical replication engine applies the change queue data to the target database. The change queue data that is not serialized at the logical level may be posted to the target database using asynchronous database access. | 12-30-2010 |
| 20100191884 | METHOD FOR REPLICATING LOCKS IN A DATA REPLICATION ENGINE - An automated method is provided of replicating a locking protocol in a database environment for performing I/O operations wherein the database environment includes a plurality of databases. A locking protocol is performed that includes one or more explicit locking operations on objects in a first database of the database environment. The one or more explicit locking operations are replicated in one or more other databases in the database environment. At least some of the explicit locking operations are performed asynchronously with respect to the explicit locking operations performed in the first database. I/O operations are performed at the first database of the database environment that are associated with the one or more explicit locking operations implemented in the first database. | 07-29-2010 |
| 20100114841 | Referential Integrity, Consistency, and Completeness Loading of Databases - A method is provided for loading data from a source database to a target database that includes at least one table. Prior to loading the data from the source database into the target database, at least one referential integrity constraint and/or at least one consistency requirement regarding the data is automatically identified. A subset of the data that satisfies the at least one referential integrity constraint and/or consistency requirement is then automatically identified. The identified subset of the data is then loaded into the target database as a unit of work. | 05-06-2010 |
| 20090313311 | MIXED MODE SYNCHRONOUS AND ASYNCHRONOUS REPLICATION SYSTEM - A replication system that includes an asynchronous replication mode and a synchronous replication mode replicates data associated with a plurality of transactions. The replication system includes one or more target nodes connected via communication media in a topology. Each target node includes a database and a plurality of appliers allocated thereto. Each transaction has one or more transaction steps or operations. A first set of transaction steps or operations are allocated to the plurality of appliers on an object-by-object basis when the replication system operates in asynchronous replication mode. A second set of transaction steps or operations are allocated to the plurality of appliers on a transaction-by-transaction basis when the replication system operates in synchronous replication mode. The replication system further includes one or more originating nodes, and the requests for the first and second sets of transaction steps or operations to execute on an originating node can be initiated during the same time period. | 12-17-2009 |
| 20090265352 | METHODS FOR ENSURING FAIR ACCESS TO INFORMATION - Locks placed on corresponding objects held in a plurality of databases located at different nodes in a network during replication are released in accordance with fairness criteria. Propagation delays are determined between a transaction initiating node and one or more other nodes in the network. An object is locked during a transaction being executed at the transaction initiating node. Corresponding objects are locked at one or more other nodes in the network that are manipulated as a result of the replication Upon determining that the object locks should be released, the propagation delays are used to determine when to release the object locks so that all of the object locks at the one or more other nodes are released in accordance with the fairness criteria. | 10-22-2009 |
| 20090242639 | OPTICAL MARK READING THAT USES A DISREGARD STATE AS PART OF AN UNAMBIGUOUS SYMBOLOGY OF MARKS TO FILL INTO RESPONSE BUBBLES - Response bubbles on a scannable form are provided that allow a user to mark the bubbles in a manner that signifies that the user wishes to have a response disregarded. | 10-01-2009 |
| 20090177710 | METHOD FOR RESOLVING COLLISIONS IN A DATABASE REPLICATION SYSTEM BY RELAXING A CONSTRAINT THAT CONTRIBUTES TO COLLISIONS, OR REMOVING THE CAUSE OF THE CONSTRAINT THAT CONTRIBUTES TO THE COLLISIONS - A method is provided for resolving collisions in a database replication system. The system includes a source database and a target database, wherein changes made at the source database are replicated to the target database. Each database has one or more tables, and at least one of the tables has multiple constraints. A collision is detected during data replication as a result of one of the tables having multiple constraints. One constraint that contributes to the collision is identified. The constraint that contributes to the collision is relaxed, or the cause of the constraint that contributes to the collision is removed. This process is repeated for all additional constraints that contribute to the collision. In this manner, the collision is resolved. | 07-09-2009 |
| 20090116748 | INFERENTIAL SELF-REGISTRATION OF IMPERFECT OMR FORMS - Image data of a zone in a response form that has a plurality of response bubbles in the zone is processed. The image data of the zone has at least one response bubble that is well-formed and at least one response bubble that is not well-formed. Well-formed response bubbles are located in the zone from image data of the zone. The locations of the well-formed response bubbles in the zone are compared to a form template that defines the zone and contains data regarding locations of all expected response bubbles in the zone. It is determined from the comparison whether sufficient information exists to determine that the well-formed response bubbles constitute a specific part of the form template zone. If so, then the well-formed response bubbles are processed from the image data of the zone. | 05-07-2009 |
| 20090063897 | METHOD OF INCREASING SYSTEM AVAILABILITY BY ASSIGNING PROCESS PAIRS TO PROCESSOR PAIRS - A method is provided of assigning processors in a multiprocessor environment to a plurality of processes that are executed in the multiprocessor environment. Each process has a process pair defined by a primary process that executes on a first processor, and a backup process that executes on a second processor. There are a plurality of process pairs. The processors are in communication with one another via a communication network. The processors are associated with a plurality of predefined processor pairs. First, a plurality of process pairs are provided that are initially assigned to a respective plurality of pairs of processors, wherein at least one of the processors in the plurality of pairs of processors is initially assigned to more than one processor pair. Each processor is then assigned to only one of the predefined processor pairs so that no processor belongs to more than one processor pair. Then, each of the plurality of process pairs are assigned to a respective one of the predefined processor pairs. This assigning process results in a configuration that reduces the number of failure modes from the number of failure modes that exists in the initial configuration. | 03-05-2009 |
