Patent application number | Description | Published |
20080288554 | DYNAMIC CLUSTER DATABASE ARCHITECTURE - A method for implementing distributed database management system operations on a computer cluster. The method includes defining ownership relationships between a plurality of computers in the computer cluster and a plurality of data nodes in the computer cluster, wherein a distributed database management system operation can be directly carried out by a first computer only on those data nodes owned by the first computer. The method further includes monitoring database usage characteristics. The method further includes carrying out a re-architecture step in response to the database usage characteristics by redefining ownership relationships to improve the efficiency of the distributed database management system operations. | 11-20-2008 |
20090055348 | DYNAMIC CLUSTER DATABASE ARCHITECTURE - A method for implementing a set of database management components in a distributed database management system, the distributed database management system being implemented on a computer cluster. The method includes managing resources associated with an associated computer, the associated computer being one of a plurality of computers in the computer cluster. The method also includes managing locks on data stored on a plurality of associated data nodes coupled to the associated computer, wherein the associated data nodes are data nodes of a plurality of data nodes in the computer cluster. The method also includes specifying logical connections for the plurality of associated data nodes. | 02-26-2009 |
20090217018 | METHODS, APPARATUS AND ARTICLES OF MANUFACTURE FOR REGAINING MEMORY CONSISTENCY AFTER A TRAP VIA TRANSACTIONAL MEMORY - Embodiments of the invention provide a method for regaining memory consistency after a trap via transactional memory. Transactional memory and a transactional memory log are used to undo changes made to memory from a transaction start point up to the point of a trap event. After the trap event is processed, and the changes are rolled back, the program can resume execution at the beginning of the transaction. | 08-27-2009 |
20110131192 | Approaches to Reducing Lock Communications In a Shared Disk Database - Lock communications in a shared disk database system is reduced by several approaches: sending a single message to a lock manager for locks required for an operation and locks that will be required in the future, the operations may include row update, row delete, large scan, and row insert; performing an operation in two executions, where in a first execution locks required for the operation is determined without performing the operation, and in a second execution a single message is sent to a lock manager for the required locks and the operation is performed; in free space searching, sending a single message to a lock manager for row and page locks before a row insert is actually performed; and granting locks in an unfair manner. | 06-02-2011 |
20110137861 | Methods for Achieving Efficient Coherent Access to Data in a Cluster of Data Processing Computing Nodes - A coherency manager provides coherent access to shared data by receiving a copy of updated database data from a host computer through RDMA, the copy including updates to a given database data; storing the copy of the updated database data as a valid copy of the given database data in local memory; invalidating local copies of the given database data on other host computers through RDMA; receiving acknowledgements from the other host computers through RDMA that the local copies of the given database data have been invalidated; and sending an acknowledgement of receipt of the copy of the updated database data to the host computer through RDMA. When the coherency manager receives a request for the valid copy of the given database data from a host computer through RDMA, it retrieves the valid copy of the given database data from the local memory and returns the valid copy through RDMA. | 06-09-2011 |
20110137874 | Methods to Minimize Communication in a Cluster Database System - An ordering of operations in log records includes: performing update operations on a shared database object by a node; writing log records for the update operations into a local buffer by the node, the log records each including a local virtual timestamp; determining that a log flush to write the log records in the local buffer to a persistent storage is to be performed; in response, sending a request from the node to a log flush sequence server for a log flush sequence number; receiving the log flush sequence number by the node; inserting the log flush sequence number into the log records in the local buffer; and performing the log flush to write the log records in the local buffer to the persistent storage, where the log records written to the persistent storage comprises the local virtual timestamps and the log flush sequence number. | 06-09-2011 |
20140280372 | PARTITIONING DATA FOR PARALLEL PROCESSING - According to one embodiment of the present invention, a system partitions data for parallel processing and comprises one or more computer systems with at least one processor. The system partitions data of a data object into a plurality of data partitions within a data structure based on a plurality of keys. The data structure includes a plurality of dimensions and each key is associated with a corresponding different dimension of the data structure. Portions of the data structure representing different data partitions are assigned to the computer systems for parallel processing, and the assigned data structure portions are processed in parallel to perform an operation. Embodiments of the present invention further include a method and computer program product for partitioning data for parallel processing in substantially the same manner described above. | 09-18-2014 |
20140324917 | RECLAMATION OF EMPTY PAGES IN DATABASE TABLES - Provided are techniques for reclamation of empty pages in database tables. In response to receiving a plurality of records for insertion into a database table, the plurality of records are inserted into one or more contiguous pages. In response to at least some of the plurality of records being deleted from the database table, the one or more contiguous pages are reclaimed by: relocating any records from the plurality of records remaining in the one or more contiguous pages and releasing the one or more contiguous pages. | 10-30-2014 |
20150032780 | PARTITIONING DATA FOR PARALLEL PROCESSING - According to one embodiment of the present invention, a system partitions data for parallel processing and comprises one or more computer systems with at least one processor. The system partitions data of a data object into a plurality of data partitions within a data structure based on a plurality of keys. The data structure includes a plurality of dimensions and each key is associated with a corresponding different dimension of the data structure. Portions of the data structure representing different data partitions are assigned to the computer systems for parallel processing, and the assigned data structure portions are processed in parallel to perform an operation. Embodiments of the present invention further include a method and computer program product for partitioning data for parallel processing in substantially the same manner described above. | 01-29-2015 |
Patent application number | Description | Published |
20080235245 | COMMITMENT OF TRANSACTIONS IN A DISTRIBUTED SYSTEM - A computer program product and system for committing transactions in a distributed system are provided. The method, computer program product, and system provide for receiving a request from a client to commit a transaction at a coordinator node in the distributed system, tracking a tail log sequence number for every other node in the distributed system, determining a max log sequence number associated with the transaction for each participant node in the distributed system, and committing the transaction at the coordinator node when the tail log sequence number for each participant node is greater than or equal to the max log sequence number associated with the transaction at the respective participant node. | 09-25-2008 |
20090150616 | SYSTEM AND METHOD OF USING THREADS AND THREAD-LOCAL STORAGE - A system is provided that includes processing logic and a memory management module. The memory management module is configured to allocate a portion of memory space for a thread stack unit and to partition the thread stack unit to include a stack and a thread-local storage region. The stack is associated with a thread that is executable by the processing logic and the thread-local storage region is adapted to store data associated with the thread. The portion of memory space allocated for the thread stack unit is based on a size of the thread-local storage region that is determined when the thread is generated and a size of the stack. | 06-11-2009 |
20100223243 | AUTOMATIC DETECTION AND CORRECTION OF HOT PAGES IN A DATABASE SYSTEM - According to one embodiment of the present invention, a method for detecting and correcting hot pages in a database system is provided. According to one embodiment of the present invention, a method includes monitoring transactions involving pages in a database and determining if one of the transactions had to wait for access to one of the pages; incrementing a page contention counter each time one of the transactions had to wait for access to one of the pages. The method then determines if the page contention counter exceeds a predetermined threshold and monitors transactions on one of the pages for which the page contention count was exceeded. The method then determines if a row was accessed in the page for which the page contention count was exceeded and increments a reference count for the accessed row. the accessed rows are flagged when the reference count exceeds a second predetermined threshold. The flagged rows are moved to another page in the database. | 09-02-2010 |